【Lintcode】375. Clone Binary Tree

题目地址：

https://www.lintcode.com/problem/clone-binary-tree/description

Deep copy一棵二叉树。直接用分治法，如果树空返回null，否则先copy树根，接着分而治之，copy左右子树，再接上去即可：

public class Solution {
    /**
     * @param root: The root of binary tree
     * @return: root of new tree
     */
    public TreeNode cloneTree(TreeNode root) {
        // write your code here
        if (root == null) {
            return null;
        }
        
        TreeNode copy = new TreeNode(root.val);
        copy.left = cloneTree(root.left);
        copy.right = cloneTree(root.right);
        
        return copy;
    }
}

class TreeNode {
    int val;
    TreeNode left, right;
    TreeNode(int x) {
        val = x;
    }
}

时间复杂度$O(n)$，空间复杂度$O(h)$。