1. CONSTRUCT BINARY TREE FROM PREORDER AND INORDER TRAVERSAL

2. BINARY TREE LEVEL ORDER TRAVERSAL

3. PRINT LEFT VIEW OF BINARY TREE

4. DISPLAY THE RIGHT VIEW OF BINARY TREE

5. CONSTRUCT BINARY TREE FROM POSTORDER AND INORDER TRAVERSAL

6. FIND THE MAXIMUM DEPTH OF BINARY TREE

7. CREATE BINARY SEARCH TREE USING ARRAYS (INSERT, DELETE, SEARCH, PREORDER, INORDER, POSTORDER, MINIMUM ELEMENT)

8. CREATE BINARY SEARCH TREE DYNAMICALLY (INSERT, DELETE, SEARCH, PREORDER, INORDER, POSTORDER, MINIMUM ELEMENT)

9. FIND INORDER PREDECESSOR AND INORDER SUCCESSOR OF BINARY SEARCH TREE (DYNAMICALLY REPRESENTED)

10. CHECK WHETHER BINARY SEARCH TREE CONTAINS DEAD END

11. CREATE BINARY TREE TO BINARY SEARCH TREE THROUGH ARRAY.

12. FIND KTH LARGEST ELEMENT IN BINARY SEARCH TREE THROUGH ARRAY

13. FIND KTH SMALLEST ELEMENT IN A BINARY SEARCH TREE THROUGH ARRAY

14. PRINT PREORDER TRAVERSAL TO POSTORDER TRAVERSAL OF BINARY SEARCH TREE

15. CONSTRUCT BINARY SEARCH TREE FROM GIVEN PREORDER TRAVERSAL THROUGH ARRAYS

16. CONSTRUCT BINARY SEARCH TREE FROM GIVEN POSTORDER TRAVERSAL THROUGH ARRAYS

17. CREATE STRICTLY BINARY TREE FROM THE GIVEN INPUT BY THE USER (DYNAMICALLY)

18. CREATE ALMOST COMPLETE BINARY TREE FROM THE GIVEN INPUT BY THE USER (DYNAMICALLY)

19. CREATE COMPLETE BINARY TREE FROM THE GIVEN INPUT BY THE USER (DYNAMICALLY)

20. COUNT THE NUMBER OF NODES IN BINARY SEARCH TREE CONSTRUCTED DYNAMICALLY