Given a Complete Binary Tree, the task is to print the elements in the Clockwise Triangular traversal order. Examples : Input : 1 / \ 2 3 / \ / \ 4 Read more →
Binary Tree
3 postsGiven 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 Read more →
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 Read more →