How to Find the Kth Smallest Element in a BST Tree Using Java/C++? January 13, 2019 algorithms, c / c++, DFS, java No Comments Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. You may assume k is always valid, 1 ≤ k ≤ BST’s … [Continue Reading...]