LintCode-375.克隆二叉树

     1
   /  \
  2    3
 / \
4   5

     1
   /  \
  2    3
 / \
4   5

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
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 cloneNode = new TreeNode(root.val);
        cloneNode.left = cloneTree(root.left);
        cloneNode.right = cloneTree(root.right);
        return cloneNode;
    }
}