LeetCode //C - 99. Recover Binary Search Tree

最新推荐文章于 2025-05-09 14:48:06 发布

Navigator_Z

最新推荐文章于 2025-05-09 14:48:06 发布

阅读量673

点赞数 9

分类专栏： LeetCode 文章标签： leetcode c语言算法

本文链接：https://blog.csdn.net/navicheung/article/details/138989660

版权

LeetCode 专栏收录该内容

664 篇文章

订阅专栏

99. Recover Binary Search Tree

You are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changing its structure.

Example 1:

在这里插入图片描述

Input: root = [1,3,null,null,2]
Output: [3,1,null,null,2]
Explanation: 3 cannot be a left child of 1 because 3 > 1. Swapping 1 and 3 makes the BST valid.

Example 2:

在这里插入图片描述

Input: root = [3,1,4,null,null,2]
Output: [2,1,4,null,null,3]
Explanation: 2 cannot be in the right subtree of 3 because 2 < 3. Swapping 2 and 3 makes the BST valid.

Constraints:

The number of nodes in the tree is in the range [2, 1000].
$2^{31} <= Node.val <= 2^{31} - 1$

From: LeetCode
Link: 99. Recover Binary Search Tree

Solution:

Ideas:

inorderTraversal function performs an in-order traversal of the tree, keeping track of the previous node (prev). It identifies the first and second nodes that are out of order (first and second).
recoverTree function calls inorderTraversal to identify the two nodes and then swaps their values.
newTreeNode are helper functions for creating and printing the tree, respectively.

Code:

void inorderTraversal(struct TreeNode* root, struct TreeNode** prev, struct TreeNode** first, struct TreeNode** second) {
    if (root == NULL) return;
    
    // Traverse left subtree
    inorderTraversal(root->left, prev, first, second);
    
    // Process current node
    if (*prev && (*prev)->val > root->val) {
        if (*first == NULL) {
            *first = *prev;
        }
        *second = root;
    }
    *prev = root;
    
    // Traverse right subtree
    inorderTraversal(root->right, prev, first, second);
}

void recoverTree(struct TreeNode* root) {
    struct TreeNode *prev = NULL, *first = NULL, *second = NULL;
    
    // Perform in-order traversal to find the two nodes
    inorderTraversal(root, &prev, &first, &second);
    
    // Swap the values of the two nodes
    if (first && second) {
        int temp = first->val;
        first->val = second->val;
        second->val = temp;
    }
}

// Helper function to create a new tree node
struct TreeNode* newTreeNode(int val) {
    struct TreeNode* node = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    node->val = val;
    node->left = NULL;
    node->right = NULL;
    return node;
}