655. 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].

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/print-binary-tree
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

        首先先确定答案中每行的个数，即2^hight - 1。然后对于每个节点，实际上，是放在每行的最中间。如果第一行有7个，那么根节点就放在第3个，然后它两个子节点，会放在第二行的，0~3与3~6的中间。即每次只要把范围对半，然后递归放置即可。

class Solution {
    List<List<String>> ans = new ArrayList<>();
    public List<List<String>> printTree(TreeNode root) {
        int hight = count(root);
        int length = (int)(Math.pow(2, hight) - 1);
        for (int i = 0; i < hight; i++) {
            List<String> list = new ArrayList<>();
            for (int j = 0; j < length; j++) {
                list.add("");
            }
            ans.add(list);
        }
        fill(root, 0, length, 0);
        return ans;
    }

    private void fill(TreeNode root, int begin, int end, int hight) {
        if (root == null) {
            return;
        }
        ans.get(hight).set((begin + end) / 2, String.valueOf(root.val));
        fill(root.left, begin, (begin + end) / 2, hight + 1);
        fill(root.right, (begin + end) / 2, end, hight + 1);
    }

    private int count(TreeNode root) {
        if (root == null) {
            return 0;
        }
        return Math.max(count(root.left), count(root.right)) + 1;
    }
}