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 Tree Traversals (Dynamic) 1.6 Set A a) BST implementation. 1.7 Set A b) Counting nodes in BST 1.8 Set B a) Copy and Compare BST 1.9 Set C a) 1.10 Set C b) 1.11 Set C c)
