## Build a Binary Search Tree from a Postorder Sequence

Given a distinct sequence of keys which represents postorder traversal of a binary search tree, construct the tree from the postorder sequence.

Coding made easy

Given a distinct sequence of keys which represents postorder traversal of a binary search tree, construct the tree from the postorder sequence.

Given a distinct sequence of keys which represents preorder traversal of a binary search tree (BST), construct the tree from the postorder sequence.

Given a binary search tree, modify it such that every key is updated to contain sum of all greater keys present in BST.

Given a BST, find inorder successor of a given key in it. If the given key do not lie in the BST, then return the next greater key (if any) present in the BST.

Given a sorted Doubly Linked List, in-place convert it into a height-balanced Binary Search Tree (BST). The difference between the height of the left and right subtree for every node of a height-balanced BST is never greater than 1.

Given a BST and a valid range of keys, remove nodes from BST that have keys outside the valid range.

Given a binary search tree, find a pair with given sum present in it.

Convert a given binary tree to BST (Binary Search Tree) by keeping original structure of the binary tree intact.

Write an efficient algorithm to replace every element of a given array with the least greater element on its right or with -1 if there are no greater element.

Given a binary tree, write an efficient algorithm to print binary tree structure in standard output.

Given a BST, find floor and ceil of a given key in it. If the given key lie in the BST, then both floor and ceil is equal to that key, else ceil is equal to next greater key (if any) in the BST and floor is equal to previous greater key (if any) in …

Given a Binary Search Tree and a positive number K, find K’th smallest and K’th largest element in BST.