Abhilietcode.hashnode.devยทJun 23, 2024Kth Smallest Element in a BST (Medium)Given the root of a binary search tree, and an integer k, return the k<sup>th</sup> smallest value (1-indexed) of all the values of the nodes in the tree. Example 1: Input: root = [3,1,4,null,2], k = 1 Output: 1 Example 2: Input: root = [5,3,6,2,4...TreesTreeAdd a thoughtful commentNo comments yetBe the first to start the conversation.
