Software Engineer

Given the root node of a Binary Search Tree (BST), you have to return the Kth largest element in the BST.

For Example:

If K is 4 and the tree is depicted by the following image then,

The 4th largest element in the given BST is 1. So the output will be 1.

Follow-up :

 Try to do it in O(1) space without using recursion.

Given a binary tree, return the vertical order traversal of the values of the nodes of the given tree.

For each node at position (X, Y), (X-1, Y-1) will be its left child position while (X+1, Y-1) will be the right child position.

Running a vertical line from X = -infinity to X = +infinity, now whenever this vertical line touches some nodes, we need to add those values of the nodes in order starting from top to bottom with the decreasing ‘Y’ coordinates.

Note:

If two nodes have the same position, then the value of the node that is added first will be the value that is on the left side.

For example:

For the binary tree in the image below.

The vertical order traversal will be {2, 7, 5, 2, 6, 5, 11, 4, 9}.

Tell me about yourself.
Why do you want to join us?
What do you know about us?
Will you be willing to relocate if needed?