问题描述
- Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a 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 :
问题分析
- 验证一棵树是否是二叉搜索树。可以有以下两种做法:
- DFS.
验证一棵树是否是二叉搜索树,必须满足:
- 当前根节点值在(minNode.val, maxNode.val)范围之内
- 左子树是BST
- 右子树是BST
那么minNode 与 maxNode 从何而来,初始状态下为null,对左子树进行递归时,当前根节点作为左子树的maxNode, 对右子树进行递归时,当前根节点作为右子树的 minNode。
- DFS.
- 中序遍历非递归形式
因为BST的中序遍历一定是一个升序序列(未若存在重复元素的情况),所以对它进行中序遍历,将每一次待打印的时候与preNode进行比较,若大于,则更新curNode 与 preNode ,继续迭代。若小于等于,则false
经验教训
- 判断BST的两种方法
- 不能用系统最大值或最小值初始化,用null去初始化。
代码实现
- DFS
public boolean isValidBST(TreeNode root) {
if (root == null ) {
return true;
}
return isValidBST(root, null, null);
}
*/
public boolean isValidBST(TreeNode root, TreeNode minNode, TreeNode maxNode) {
if(root == null) {
return true;
}
//从三方面验证:当前节点值在(minNode.val, maxNode.val)范围之内,并且左右子树都是BST
return (minNode == null || root.val > minNode.val) && (maxNode == null || root.val < maxNode.val) && isValidBST(root.left, minNode, root) && isValidBST(root.right, root, maxNode);
/*
if((minNode != null && root.val <= minNode.val) || (maxNode != null && root.val >= maxNode.val)) {
return false;
}
return isValidBST(root.left, minNode, root) && isValidBST(root.right, root, maxNode);
*/
}
- 中序遍历非递归
public boolean isValidBST(TreeNode root) {
if (root == null ) {
return true;
}
//用于记录前一个中序遍历的节点
TreeNode preNode = null;
Stack<TreeNode> stack = new Stack<>();
TreeNode curNode = root;
while(curNode != null || !stack.isEmpty()) {
while (curNode != null) {
stack.push(curNode);
curNode = curNode.left;
}
curNode = stack.pop();
//验证当前出栈元素是否大于前一个元素
if (preNode != null && curNode.val <= preNode.val) {
return false;
}
//迭代
preNode = curNode;
curNode = curNode.right;
}
return true;
}