Recover Binary Search Tree

最新推荐文章于 2022-03-13 20:36:15 发布

kassical

最新推荐文章于 2022-03-13 20:36:15 发布

阅读量609

点赞数

分类专栏： LeetCode 文章标签： leetcode 二叉树中序遍历

本文链接：https://blog.csdn.net/kassical/article/details/38670707

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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?

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
	void recoverTree(TreeNode *root) {
		TreeNode *p1 = NULL, *p2 = NULL, *pre = NULL;
		travel(root, pre, p1, p2);
		if (p1 && p2) {
			int temp = p1->val;
			p1->val = p2->val;
			p2->val = temp;
		}
	}

	void travel(TreeNode *root, TreeNode *&pre, TreeNode *&p1, TreeNode *&p2) {
		if (root == NULL)
			return;
		travel(root->left, pre, p1, p2);

		if (pre && root->val < pre->val) {
			if (!p1) {
				p1 = pre;
				p2 = root;
			}
			else {
				p2 = root;
			}
		}
		pre = root;

		travel(root->right, pre, p1, p2);
	}
};