Data Structures (II) – Computational Mathematics

Content Covered
Binary Trees
Traversing of Binary Trees
Binary Search Tree
Searching and Inserting in Binary Search Trees
Past Years Questions

Chapter Objectives

At the completion of this chapter, you would have learnt:

  • How to acquire the ability to manipulate or to use the different types if data structures;
  • How to construct and traverse a binary tree;
  • Comparison of data structures.

Note: To easily navigate through these KNEC Pdf notes below, Mobile phone users are advised to use Mozilla or Chrome browsers

[tnc-pdf-viewer-iframe file=”” width=”100%” height=”800″ download=”false” print=”false” fullscreen=”false” share=”true” zoom=”false” open=”true” pagenav=”true” logo=”true” find=”true” current_view=”false” rotate=”true” handtool=”true” doc_prop=”true” toggle_menu=”true” language=”en-US” page=”” default_zoom=”auto” pagemode=””]