Question

Find the minimum sum root to leaf path in a binary search tree

Answer 1

Get the root to leaf path in a Binary Treesuch that the sum of the node values in that path is minimum among all possible root to leaf paths. For e.g, for the tree shown below, minimum sum path is 31 ( 15 + 10 + 6 ) .