LeetCode: Binary Search Tree Iterator 解题报告
Binary Search Tree Iterator Implement an iterator over a binary search tree (BST). Your iterator will be initialized ...
原文：LeetCode: Recover Binary Search Tree 解题报告
Recover Binary Search Tree Two elements of a binary search tree BST are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O n space is pretty straight forward ...
2015-01-07 14:06 0 2297 推荐指数：
相关推荐
LeetCode: Validate Binary Search Tree 解题报告
Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left ...
LeetCode:Recover Binary Search Tree
其他LeetCode题目欢迎访问：LeetCode结题报告索引 题目链接 Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its ...
LeetCode: Lowest Common Ancestor of a Binary Search Tree 解题报告
https://leetcode.com/submissions/detail/32662938/ Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes ...
[leetcode]Recover Binary Search Tree @ Python
原题地址：https://oj.leetcode.com/problems/recover-binary-search-tree/ 题意： Two elements of a binary search tree (BST) are swapped by mistake. Recover ...
Recover Binary Search Tree leetcode java
题目： Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using ...
LeetCode: Binary Tree Preorder Traversal 解题报告
Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3 ...
LeetCode: Unique Binary Search Trees II 解题报告
Unique Binary Search Trees II Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n ...