226. 翻转二叉树

题目

翻转一棵二叉树。
示例：

输入：

输出：

解1-dfs

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root==null){
            return null;
        }

        TreeNode lNode=invertTree(root.left);
        TreeNode rNode=invertTree(root.right);
        root.left=rNode;
        root.right=lNode;

        return root; 
    }
}

时间复杂度O(n): 遍历整棵树的节点
空间复杂度O(n): 退化为链表递归深度n

解2-BFS

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root==null){
            return null;
        }

        Deque<TreeNode> queue=new LinkedList<>();
        queue.add(root);

        while(!queue.isEmpty()){
            TreeNode node=queue.remove();
            TreeNode tmp=node.left;
            node.left=node.right;
            node.right=tmp;

            if(node.left!=null){
                queue.add(node.left);
            }

            if(node.right!=null){
                queue.add(node.right);
            }
        }
        return root;
    }
}

时间复杂度O(n): 遍历所有节点
空间复杂度O(n):队列最多包含所有叶子节点

推导结论:如果一棵完全二叉树的结点总数为n，那么叶子结点等于n/2（当n为偶数时）或者(n+1)/2（当n为奇数时）