[LeetCode] 98. Validate Binary Search Tree

来源:互联网 发布:linux hadoop 编辑:程序博客网 时间:2024/06/05 18:42
/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public boolean isSymmetric(TreeNode root) {        if(root == null) return true;        return helper(root, root.left, root.right);    }        private boolean helper(TreeNode root, TreeNode p, TreeNode q){        if(p == null && q == null){            return true;        }        if(p == null || q == null){             return false;        }        if(p.val != q.val){            return false;        }        return helper(root, p.left, q.right) && helper(root, p.right, q.left);    }}

0 0
原创粉丝点击