Problem Statement
Adding a function to the BST to find the kth-smallest element in the entire binary search tree. If possible I would also like to extend it to find the kth-largest element in the BST.
Motivation
This problem was asked in Leetcode Challenge. I thought that this will be a good addition( if not absolutely necessary) to the BST functions.
Problem Statement
Adding a function to the BST to find the kth-smallest element in the entire binary search tree. If possible I would also like to extend it to find the kth-largest element in the BST.
Motivation
This problem was asked in Leetcode Challenge. I thought that this will be a good addition( if not absolutely necessary) to the BST functions.