101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:

    1
   / \
  2   2
 / \ / \
3  4 4  3

But the following is not:

    1
   / \
  2   2
   \   \
   3    3

Solution 1  Recursive

1ms 23.66

public class Solution {
    public boolean isSymmetric(TreeNode root) {
      	if(root == null){
			return true;
		}
		return check(root.left, root.right);
    }
    private static boolean check(TreeNode left, TreeNode right) {
		if(left == null && right == null){
			return true;
		}
		if(left == null || right == null){
			return false;
		}
		if(left.val != right.val){
			return false;
		}
		return check(left.left, right.right) && check(left.right, right.left);
	}
	
}

Solution 2 Non-recursive

3ms 5.72

public class Solution {
    public boolean isSymmetric(TreeNode root) {
        if(root == null){
            return true;
        }
        Stack<TreeNode> stack = new Stack<TreeNode>();
        stack.push(root.left);
        stack.push(root.right);
        boolean flag = true;
        while(!stack.isEmpty()){
            TreeNode right = stack.pop();
            TreeNode left = stack.pop();
            if((left == null) && (right == null)){
                continue;
            }
            if((left == null)||(right == null)){
                flag = false;
                break;
            }
            if(left.val != right.val){
                flag = false;
                break;
            }
            stack.push(left.left);
            stack.push(right.right);
            stack.push(left.right);
            stack.push(right.left);
        }
        return flag;
    }
}