leetcode:Recover Binary Search Tree

最新推荐文章于 2020-06-07 12:47:38 发布

原创最新推荐文章于 2020-06-07 12:47:38 发布 · 519 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#algorithm #leetcode #二叉树 #遍历

算法同时被 3 个专栏收录

80 篇文章

订阅专栏

LeetCode

11 篇文章

订阅专栏

搜索

10 篇文章

订阅专栏

本文介绍了一种常数空间解决方案，用于在二叉搜索树中找到并修复由错误交换导致的位置不正确的节点，通过中序遍历来定位问题节点并进行交换。

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. Could you devise a constant space solution?

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

中序遍历，找出位置不正确的节点，记录下来，最后交换即可。

void help(TreeNode* root, TreeNode* &pre, TreeNode*&first, TreeNode*&second){
	if (root == NULL)
		return;
	help(root->left,pre, first, second);
	if (pre == NULL)
		pre = root;
	else{
		if (pre->val > root->val){
			if (first == NULL){
				first = pre;
				second = root;
			}
			else{
				second = root;
				return;
			}
		}
		pre = root;
	}
	help(root->right, pre, first, second);
}

void recoverTree(TreeNode *root) {
	TreeNode* pre = NULL;
	TreeNode* first = NULL, *second = NULL;
	if (root == NULL)
		return;
	help(root, pre, first, second);
	int tmp = first->val;
	first->val = second->val;
	second->val = tmp;
}