Leetcode655. Print Binary Tree

Print a binary tree in an m*n 2D string array following these rules:

The row number m should be equal to the height of the given binary tree.
The column number n should always be an odd number.
The root node’s value (in string format) should be put in the exactly middle of the first row it can be put. The column and the row where the root node belongs will separate the rest space into two parts (left-bottom part and right-bottom part). You should print the left subtree in the left-bottom part and print the right subtree in the right-bottom part. The left-bottom part and the right-bottom part should have the same size. Even if one subtree is none while the other is not, you don’t need to print anything for the none subtree but still need to leave the space as large as that for the other subtree. However, if two subtrees are none, then you don’t need to leave space for both of them.
Each unused space should contain an empty string “”.
Print the subtrees following the same rules.
Example 1:
Input:
1
/
2
Output:
[[“”, “1”, “”],
[“2”, “”, “”]]
Example 2:
Input:
1
/ \
2 3
\
4
Output:
[[“”, “”, “”, “1”, “”, “”, “”],
[“”, “2”, “”, “”, “”, “3”, “”],
[“”, “”, “4”, “”, “”, “”, “”]]
Example 3:
Input:
1
/ \
2 5
/
3
/
4
Output:

[[“”, “”, “”, “”, “”, “”, “”, “1”, “”, “”, “”, “”, “”, “”, “”]
[“”, “”, “”, “2”, “”, “”, “”, “”, “”, “”, “”, “5”, “”, “”, “”]
[“”, “3”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”]
[“4”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”]]
Note: The height of binary tree is in the range of [1, 10].

如题意打印二叉树，先求出树的高度，然后把所有值赋初值”“。
递归左右子树去set值。

package leetcode;

import java.util.ArrayList;
import java.util.List;

/**
 * Created by linjian on 17/8/9.
 */
public class Leetcode655 {
    public  int maxDepth(TreeNode root) {
        if(root == null)
            return 0;
        else if(root.left == null && root.right == null)
            return 1;
        else
        {
            int leftDepth= maxDepth(root.left);
            int rightDepth = maxDepth(root.right);
            if(leftDepth > rightDepth)
                return leftDepth +1;
            else
                return rightDepth +1;
        }

    }
    public List<List<String>> printTree(TreeNode root) {
        int depth = maxDepth(root);
        List<List<String>> res = new ArrayList<>();
        int n =1;
        for (int i=0;i<depth;i++){
            n = n<<1;
        }
        n=n-1;
        for (int i=0;i<depth;i++) {
            List<String> list = new ArrayList<String>(n);
            for (int j = 0; j < n; j++) {
                list.add("");
            }
            res.add(list);
        }
        res = subPrint(res,root,0,n,1,depth);
        return res;
    }
    public List<List<String>>subPrint(List<List<String>> list,TreeNode root,int left,int right,int cur,int max){
        if(cur>max || root == null||left>right) return null;
        int mid = (left+right)/2;
        list.get(cur-1).set(mid, String.valueOf(root.val));
        subPrint(list, root.left, left, mid - 1, cur + 1, max);
        subPrint(list,root.right,mid+1,right,cur+1,max);
        return list;
    }

}