题目: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:
Input: 2 / \ 1 3 Output: true
Example 2:
5 / \ 1 4 / \ 3 6 Output: false Explanation: The input is: [5,1,4,null,null,3,6]. The root node's value is 5 but its right child's value is 4.
解法1:平衡二叉树的定义是:对于任一树节点,节点的左支部分均小于它本身,右支部分均大于它本身。因此可构建一个有最大最小值界限的函数,用于判断是否有违规现象。0ms最快
public boolean isValidBST(TreeNode root) {
return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE);
}
public boolean isValidBST(TreeNode root, long minVal, long maxVal) {
if (root == null) return true;
if (root.val >= maxVal || root.val <= minVal) return false;
return isValidBST(root.left, minVal, root.val) && isValidBST(root.right, root.val, maxVal);
}
解法2:左小于节点小于右,如果按中序遍历的结果,应该正好是一个有序序列(从小到大)2ms
public boolean isValidBST(TreeNode root) {
if(root==null) return true;
List<Integer> list= inorder(new ArrayList<>(),root);
for(int i=0; i<list.size()-1; i++){
if(list.get(i)>=list.get(i+1))
return false;
}
return true;
}
public List<Integer> inorder(List<Integer> res,TreeNode root){
if(root==null) return res;
inorder(res,root.left);
res.add(root.val);
inorder(res,root.right);
return res;
}
其中,中序遍历也可以用iterative方法,不递归,但此时的运行时间为100+ms
public boolean isValidBST(TreeNode root) {
if(root==null) return true;
List<Integer> list= inorder(root);
for(int i=0; i<list.size()-1; i++){
if(list.get(i)>=list.get(i+1))
return false;
}
return true;
}
public List<Integer> inorder(TreeNode root) {
LinkedList<TreeNode> stack= new LinkedList<>();
LinkedList<Integer> output= new LinkedList<>();
if(root==null)
return output;
stack.add(root);
TreeNode cur= root.left;
while(cur!=null || !stack.isEmpty()){
while(cur!=null){
stack.addLast(cur);
cur= cur.left;
}
cur= stack.pollLast();
output.addLast(cur.val);
cur= cur.right;
}
return output;
}