给定一个二叉树,判断其是否是一个有效的二叉搜索树。
一个二叉搜索树有如下定义:
- 左子树只包含小于当前节点的数。
- 右子树只包含大于当前节点的数。
- 所有子树自身必须也是二叉搜索树。
示例 1:
2 / \ 1 3
二叉树[2,1,3]
, 返回 true.
示例 2:
1 / \ 2 3
二叉树 [1,2,3]
, 返回 false.
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 1:
2 / \ 1 3Binary tree
[2,1,3]
, return true.
Example 2:
1 / \ 2 3
Binary tree [1,2,3]
, return false.
个人思路:
要验证二叉搜索树,可以使用中序优先搜索遍历所有节点,根据性质可知遍历的前一项一定小于当前项的值,因而可以在每次元素出栈时比较其与前一项值的大小,然后保存当前元素值作为下一步的前项值,直到栈空。
代码(JavaScript):
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
var isValidBST = function(root) {
var p=root;
var stack=[];
var current=null;
while(p!=null&&stack.length>0){
while(p!=null){
stack.push(p);
p=p.left;
}
p=stack.pop();
if(current!=null&&p.val<=current.val){
return false;
}
current=p;
p=p.right;
}
return true;
};