leetcode - Recover Binary Search Tree

 1 //比较巧妙的解决方法，copied from：
 2 //http://blog.csdn.net/jellyyin/article/details/9018803
 3 class Solution {
 4 public:
 5     void recoverTree(TreeNode *root) {
 6         // Start typing your C/C++ solution below
 7         // DO NOT write int main() function
 8         TreeNode *n1=NULL;
 9         TreeNode *n2=NULL;
10         TreeNode *prev=NULL;
11         findTwoNodes(root,n1,n2,prev);
12
13         if(n1!=NULL && n2!=NULL)
14         {
15             int tmp=n2->val;
16             n2->val=n1->val;
17             n1->val=tmp;
18         }
19     }
20     void findTwoNodes(TreeNode *root, TreeNode *&n1, TreeNode *&n2, TreeNode *&prev)
21     {
22         if(root==NULL) return;
23
24         findTwoNodes(root->left,n1,n2,prev);
25         if(prev!=NULL && prev->val > root->val)
26         {
27             n2=root;
28             if(n1==NULL)
29             {
30                 n1=prev;
31             }
32         }
33         prev=root;
34         findTwoNodes(root->right,n1,n2,prev);
35     }
36 };

转载于:https://www.cnblogs.com/zhanghs/p/3475719.html

leetcode - Recover Binary Search Tree相关推荐

[leetcode] Recover Binary Search Tree
Recover Binary Search Tree Two elements of a binary search tree (BST) are swapped by mistake. Recove ...
LeetCode 99. Recover Binary Search Tree
LeetCode 99. Recover Binary Search Tree 刚看到这个题真是一脸懵逼啊... 博客转载自:http://www.cnblogs.com/grandyang/p/42 ...
LeetCode: 173. Binary Search Tree Iterator
LeetCode: 173. Binary Search Tree Iterator 题目描述 Implement an iterator over a binary search tree (BST ...
LeetCode OJ - Recover Binary Search Tree
题目: Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without chan ...
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing ...
99. Recover Binary Search Tree (Tree; DFS)
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing ...
Recover Binary Search Tree，恢复二叉排序树
问题描述:题意就是二叉树中有两个节点交换了,恢复结构. Two elements of a binary search tree (BST) are swapped by mistake. Recov ...
LeetCode Closest Binary Search Tree Value II
原题链接在这里:https://leetcode.com/problems/closest-binary-search-tree-value-ii/ 题目: Given a non-empty bin ...
LeetCode:Validate Binary Search Tree
题目链接 Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defin ...
第五周 Leetcode 99. Recover Binary Search Tree （HARD）
Leetcode99 给定一个二叉搜索树,其中两个节点被交换,写一个程序恢复这颗BST. 只想到了时间复杂度O(n)空间复杂度O(h) h为树高的解法,还没想到空间O(1)的解法. 交换的情况只有两 ...

leetcode - Recover Binary Search Tree

leetcode - Recover Binary Search Tree相关推荐

最新文章

热门文章