1.1 Concept and Terminologies

1. Definition of Trees
2. Tree Terminologies (Root, Parent, Child, Sibling, Depth, Height, etc.)
3. Properties of Trees

1.2 Types of Binary Trees

1. Binary Tree
2. Skewed Tree (Left and Right Skewed)
3. Strictly Binary Tree
4. Full Binary Tree
5. Complete Binary Tree
6. Expression Tree
7. Binary Search Tree (BST)
8. Heap (Min-Heap & Max-Heap)

1.3 Representation of Trees

1. Static Representation (Using Arrays)
2. Dynamic Representation (Using Linked Lists)

1.4 Implementation and Operations on Binary Search Tree

1. Creation
2. Insertion
3. Deletion
4. Searching
5. Tree Traversals
   • Preorder (Recursive)
   • Inorder (Recursive)
   • Postorder (Recursive)
   • Level-order Traversal (Using Queue)
6. Counting Nodes
   • Leaf Nodes
   • Non-leaf Nodes
   • Total Nodes
7. Copying and Mirroring a Tree

1.5 Applications of Trees

1.5.1 Heap Sort

1. Concept of Heap Sort
2. Implementation of Heap Sort Algorithm

1.5.2 Greedy Strategy & Huffman Encoding

1. Introduction to Greedy Algorithm
2. Huffman Encoding
   • Concept
   • Implementation Using Priority Queue