bool isValidBST(TreeNode* root) {
if (!root) return true;
TreeNode *left = root->left;
TreeNode *right = root->right;
while (left) {
设计判断二叉树是否为二叉排序树的算法
最新推荐文章于 2023-12-02 11:20:11 发布
bool isValidBST(TreeNode* root) {
if (!root) return true;
TreeNode *left = root->left;
TreeNode *right = root->right;
while (left) {