##
Sum of k smallest elements in BST
January 14, 2017

Given Binary Search Tree. The task is to find sum of all elements smaller than and equal to Kth smallest element. Examples: Input : K = 3 8 / \ 7 10 / / \ 2 9 13 Output : 17 Explanation : Kth smallest element is 8 so sum of all element smaller then… Read More »