101. 对称二叉树(递归和非递归实现)

就是判断对称

递归

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
        public boolean isSymmetric(TreeNode root) {
            if (root == null) return true;
            
            return dfs(root.left, root.right);
        }
        public boolean dfs(TreeNode node1, TreeNode node2){
            if (node1 == null && node2 == null) return true;
            if (node1 == null || node2 == null) return false;
            if(node1.val != node2.val) return false;

            
            return dfs(node1.left, node2.right) && dfs(node1.right, node2.left);
        }
    }

迭代（就是先将二叉树的左右子树入队，然后每次循环再出队两个元素，进行和递归结束条件相同的判断来处理返回值，循环末尾再入队left的左子树，right的右子树，left的右子树，right的左子树）往复进行判断

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
	public boolean isSymmetric(TreeNode root) {
		if(root==null || (root.left==null && root.right==null)) {
			return true;
		}
		//用队列保存节点
		LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
		//将根节点的左右孩子放到队列中
		queue.offer(root.left);
		queue.offer(root.right);
		while(queue.size()>0) {
			//从队列中取出两个节点，再比较这两个节点
			TreeNode left = queue.poll();
			TreeNode right = queue.poll();
			//如果两个节点都为空就继续循环，两者有一个为空就返回false
			if(left==null && right==null) {
				continue;
			}
			if(left==null || right==null) {
				return false;
			}
			if(left.val!=right.val) {
				return false;
			}
			//将左节点的左孩子， 右节点的右孩子放入队列
			queue.offer(left.left);
			queue.offer(right.right);
			//将左节点的右孩子，右节点的左孩子放入队列
			queue.offer(left.right);
			queue.offer(right.left);
		}
		
		return true;
	}
}

详细讲解点此进入