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", "", "", "", "", "", "", "", "", "", "", "", "", "", ""]]
层次遍历,程序如下所示:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
class Node {
public int row;
public int left;
public int right;
public TreeNode t;
public Node(int r, int left, int right, TreeNode n){
this.row = r;
this.left = left;
this.right = right;
this.t = n;
}
}
int height = 0;
public List<List<String>> printTree(TreeNode root) {
height = getHeight(root);
String[][] res = new String[height][(1<<height)-1];
for (String[] s : res){
Arrays.fill(s, "");
}
levelTraversal(root, res);
List<List<String>> llist = new ArrayList<>();
for (String[] s : res){
llist.add(Arrays.asList(s));
}
return llist;
}
public void levelTraversal(TreeNode root, String[][] res){
ArrayDeque<Node> que = new ArrayDeque<>();
que.offer(new Node(0, 0, (1 << height) - 1, root));
while (!que.isEmpty()){
Node tmp = que.poll();
res[tmp.row][(tmp.left + tmp.right) >> 1] = tmp.t.val + "";
if (tmp.t.left != null){
que.offer(new Node(tmp.row + 1, tmp.left, (tmp.left + tmp.right) >> 1, tmp.t.left));
}
if (tmp.t.right != null){
que.offer(new Node(tmp.row + 1, (tmp.left + tmp.right) >> 1, tmp.right, tmp.t.right));
}
}
}
public int getHeight(TreeNode root){
if (root == null){
return 0;
}
return Math.max(getHeight(root.left), getHeight(root.right)) + 1;
}
}
Note: The height of binary tree is in the range of [1, 10].