Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree
[1,2,2,3,4,4,3]
is symmetric:1 / \ 2 2 / \ / \ 3 4 4 3
But the following
[1,2,2,null,3,null,3]
is not:1 / \ 2 2 \ \ 3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
public static boolean isSymmetricRecursive(TreeNode root) {
// Edge
if (root == null) return true;
// Recursion
return dfs(root.left, root.right);
}
// Process
private static boolean dfs(TreeNode left, TreeNode right) {
if (left == null && right == null) return true;
if (left == null && right != null) return false;
if (left != null && right == null) return false;
if (left.val != right.val) return false;
else return dfs(left.left, right.right)&&dfs(left.right,right.left);
}
public static boolean isSymmetricIterative(TreeNode root) {
if (root == null) return true;
Queue<TreeNode> nodeQueue = new LinkedList<>();
nodeQueue.offer(root.left);
nodeQueue.offer(root.right);
while (!nodeQueue.isEmpty()) {
TreeNode l = nodeQueue.poll(), r = nodeQueue.poll();
if (l == null && r == null) continue;
else if (l == null || r == null) return false;
else {
if (l.val != r.val) return false;
nodeQueue.offer(l.left);
nodeQueue.offer(r.right);
nodeQueue.offer(l.right);
nodeQueue.offer(r.left);
}
}
return true;
}