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.
Change the left and right pointers of each node in Binary search Tree to make it a sorted doubly linked list.
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...