Binary Tree Archives

Find maximum value between two nodes in Binary tree

Given a binary tree and two nodes a and b, the task is to print the maximum node value that lies in the path connecting the nodes a and b. If either of the two nodes are not present in the tree then print -1. Examples: Input : 1 / \ 2 3 / \ \ 4 5… Read More »

Vertical order traversal of Binary Tree using Map

We all must have encountered the vertical Traversal of the Binary Tree problem. In this version of the problem we will see how we can perform the traversal vertically while keeping in mind that the order should be from left to right(just like increasing x coordinates): If the x coordinates are same then the node appearing on the… Read More »