摘要:
Problem LeetCode Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the 阅读全文
摘要:
Problem LeetCode Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Example 1: Input: root = [3,1,4,null 阅读全文