Chapter 1: Tree

Chapter 1: Tree

1.1Concept and Terminologies

1.2 Types of Binary trees - Binary tree, skewed tree, strictly binary tree, full binary tree, complete binary tree, expression tree, binary search tree, Heap

1.3 Representation – Static and Dynamic

1.4 Implementation and Operations on Binary Search Tree -

a.      Create

b.     Insert

c.      Delete

d.     Search

e.      Tree traversals– preorder, inorder, postorder (recursive implementation),

f.      Level-order traversal using queue,

g.     Counting leaf and non-leaf and total nodes,

h.     Tree Copy

i.       Tree Mirror.

1.5 Applications of trees

     1.5.1 Heap sort, implementation

     1.5.2 Introduction to Greedy strategy, Huffman encoding (implementation using priority queue)