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

-*+Today, we will see a┬áproblem, solution to which uses traversal of tree in a bit different manner. Problem statement is : Replace a node with sum of all nodes which are greater than it. First question which comes to mind is : what should be done with rightmost child of tree? Should it remain as … Continue reading Replace node with sum of all greater node in binary search tree