IncredibleThings

导航

2021年2月25日 #

LeetCode - Increasing Order Search Tree

摘要: Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every no 阅读全文

posted @ 2021-02-25 16:26 IncredibleThings 阅读(37) 评论(0) 推荐(0) 编辑

LeetCode - Range Sum of BST

摘要: Given the root node of a binary search tree, return the sum of values of all nodes with a value in the range [low, high]. Example 1: Input: root = [10 阅读全文

posted @ 2021-02-25 16:02 IncredibleThings 阅读(28) 评论(0) 推荐(0) 编辑