本文共 647 字，大约阅读时间需要 2 分钟。

原题题目

代码实现（首刷自解）

/**/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     struct TreeNode *left; *     struct TreeNode *right; * }; */#define MAX 10000#define INF 99999999bool isValidBST(struct TreeNode* root){
       struct TreeNode* queue[MAX],*pos = root;    int size = 0,prev = INF;    while(pos != NULL || size > 0)    {
           while(pos != NULL)        {
               queue[size++] = pos;            pos = pos->left;        }        pos = queue[--size];        if(prev == INF || prev < pos->val)            prev = pos->val;        else            return false;        pos = pos->right;     }    return true;}

转载地址：https://love6.blog.csdn.net/article/details/112348380 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！