Mam for implementation of binary search tree : insert, delete (full Binary Search tree), search, maximum, minimum, inorder traversal is enough mam. For implementation of binary tree and it's operations : Insert, delete (full binary tree), search, traversal (3 ) is enough mam .
The best book for referring is text book.That is mark alen weiss. My video is based on that book only. The second is you can refer reema thareja book. which is simple to follow.
