Lets discuss how to create a BST From an array.
Lets remove all duplicate elements from a sorted singly linked list.
Suppose we have a linked list and we want to reverse it in Single iteration and O(n) complexity.
Suppose we have an int array and we want to create it into a singly linked list from it.
Many times we need to search for some specific paths in a binary tree from top to bottom. Lets design a code to find out all paths in a binary tee.
Change the left and right pointers of each node in Binary search Tree to make it a sorted doubly linked list.
Many times we need to validate a Binary Search tree i.e. verifying its properties,
Many time we need to perform certain tasks on Binary trees. These tasks can be, Counting nodes that satisfy some criteria. Displaying all nodes in particular pattern like, printing expression from expression tree. Creating mirror image of tree. etc.