Update 0098.验证二叉搜索树.md

新增java 統一迭代法的寫法 有通過. AC
This commit is contained in:
Lozakaka
2023-04-25 03:25:45 -04:00
committed by GitHub
parent b253fccfba
commit bb8e7312b6

View File

@ -259,6 +259,36 @@ public:
## Java ## Java
```Java
//使用統一迭代法
class Solution {
public boolean isValidBST(TreeNode root) {
Stack<TreeNode> stack = new Stack<>();
TreeNode pre = null;
if(root != null)
stack.add(root);
while(!stack.isEmpty()){
TreeNode curr = stack.peek();
if(curr != null){
stack.pop();
if(curr.right != null)
stack.add(curr.right);
stack.add(curr);
stack.add(null);
if(curr.left != null)
stack.add(curr.left);
}else{
stack.pop();
TreeNode temp = stack.pop();
if(pre != null && pre.val >= temp.val)
return false;
pre = temp;
}
}
return true;
}
}
```
```Java ```Java
class Solution { class Solution {
// 递归 // 递归