判定一个树是否是有效的（合法的）二叉搜索树（C语言）

98. Validate Binary Search Tree （C语言）

判定一个树是否是有效的（合法的）二叉搜索树

题目

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

A valid BST is defined as follows:

• The left subtree of a node contains only nodes with keys less than
  the node’s key.
• The right subtree of a node contains only nodes with keys greater
  than the node’s key. Both the left and right subtrees must also be
  binary search trees.

Example 1:

Input: root = [2,1,3]
Output: true

Example 2:

Input: root = [5,1,4,null,null,3,6]
Output: false
Explanation: The root node’s value is 5 but its right child’s value is 4.

Constraints:
The number of nodes in the tree is in the range [1, 104].
-231 <= Node.val <= 231 - 1

解答

递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
bool Tra(struct TreeNode* root, int *min, int *max)
{
    if(root == NULL)
        return true;

    int left_min, left_max, right_min,right_max;
    
    //左右子树有一个不是，该树就不是
    if(Tra(root->left, &left_min, &left_max) == false || Tra(root->right, &right_min, &right_max) == false)
        return false;

	//左右子树与根节点对比
    if(root->left != NULL && (left_max >= root->val))
        return false;
    if(root->right != NULL && (right_min <= root->val))
        return false;
	
	//给该树的min和max赋值，考虑所有情况
    if(root->left == NULL && root->right != NULL)
    {
        *min = root->val;
        *max = right_max;
    }
    else if(root->left != NULL && root->right == NULL)
    {
        *min = left_min;
        *max = root->val;
    }
    else if(root->left != NULL && root->right != NULL)
    {
        *min = (left_min < right_min) ? left_min : right_min;
        *max = (left_max > right_max) ? left_max : right_max;
    }
    else if(root->left == NULL && root->right == NULL)
    {
        *min = root->val;
        *max = root->val;
    }

    return true;
}
bool isValidBST(struct TreeNode* root){
    int min, max;
    return Tra(root, &min, &max);
}

总结

要注意的点：

• 二叉搜索树中不能有相同的值；
• 在一个节点中，要考虑左子树和右子树是否存在，再细细讨论。