题目描述：
LeetCode 669. Trim a Binary Search Tree
Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might ...
归档 2017年9月
[LeetCode]Trim a Binary Search Tree
[LeetCode]Second Minimum Node In a Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 671. Second Minimum Node In a Binary Tree
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two ...