Closed Pratyushraj2121 closed 3 years ago
In the given code for a binary search tree where K is the input which will find K-th smallest element in BST. If BST={ 48,81,5,10, 13} then if K= 2 , it will find the 2nd smallest value in the BST i.e. 10
In the given code for a binary search tree where K is the input which will find K-th smallest element in BST. If BST={ 48,81,5,10, 13} then if K= 2 , it will find the 2nd smallest value in the BST i.e. 10