Solution 1
本体实际上就是利用BST验证其有效性,而验证过程实际上就是一个中序遍历过程。因此可以直接使用 94. Binary Tree Inorder Traversal 中的实现。需要调整的是,本体不再需要保存遍历序列,只需要保存前一个遍历到的值,确保当前值必大于旧值。
- 时间复杂度: O ( n ) O(n) O(n),其中 n n n为树的节点个数,线性遍历
- 空间复杂度: O ( 1 ) O(1) O(1),使用Morris遍历方法,仅维护常数个状态变量
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool isValidBST(TreeNode* root) {
TreeNode* cur = root;
TreeNode* pre = nullptr;
bool checked = false;
int preVal = 0;
bool ans = true;
while (cur != nullptr) {
if (cur->left == nullptr) {
if (checked) {
ans = cur->val > preVal;
preVal = cur->val;
} else {
checked = true;
preVal = cur->val;
}
cur = cur->right;
}
else {
pre = cur->left;
while (pre->right != nullptr) { pre = pre->right; }
pre->right = cur;
auto temp = cur;
cur = cur->left;
temp->left = nullptr;
}
if (!ans) { break; }
}
return ans;
}
};
Solution 2
Solution 1的Python实现
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def isValidBST(self, root: Optional[TreeNode]) -> bool:
cur = root
pre = None
preVal = None
ans = True
while cur:
if not cur.left:
if preVal is not None: ans = cur.val > preVal
preVal = cur.val
cur = cur.right
else:
pre = cur.left
while pre.right: pre = pre.right
pre.right = cur
temp = cur
cur = cur.left
temp.left = None
if not ans: break
return ans