Data Structures and Algorithms -II LAB Table of Contents 1. Binary Search Tree and Traversals 1.1 Static Representation of Binary Tree 1.2 Dynamic Representation of Binary Tree 1.3 Binary Tree Traversals (Static) 1.4 Binary Search Tree Implementation 1.5. Create BST Library ( Set A 1) 1.5 Set A b) Counting total noeds in BST 2 Set A ) Counting nodes @ level in BST
