Replace node with sum of all greater node in binary search tree

Post order traversal of binary search tree without recursion

construct binary search tree from inorder and preorder traversal

Find two nodes with given sum in binary search tree (2Sum problem)