# Print Binary Tree Problem

## Description

LeetCode Problem 655.

Given the root of a binary tree, construct a 0-indexed m x n string matrix res that represents a formatted layout of the tree. The formatted layout matrix should be constructed using the following rules:

• The height of the tree is heightand the number of rows m should be equal to height + 1.
• The number of columns n should be equal to 2^height+1 - 1.
• Place the root node in the middle of the top row (more formally, at location res[0][(n-1)/2]).
• For each node that has been placed in the matrix at position res[r][c], place its left child at res[r+1][c-2^height-r-1] and its right child at res[r+1][c+2^height-r-1].
• Continue this process until all the nodes in the tree have been placed.
• Any empty cells should contain the empty string “”.

Return the constructed matrix res.

Example 1:

``````1
2
3
4
Input: root = [1,2]
Output:
[["","1",""],
["2","",""]]
``````

Example 2:

``````1
2
3
4
5
Input: root = [1,2,3,null,4]
Output:
[["","","","1","","",""],
["","2","","","","3",""],
["","","4","","","",""]]
``````

Constraints:

• The number of nodes in the tree is in the range [1, 2^10].
• -99 <= Node.val <= 99
• The depth of the tree will be in the range [1, 10].

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
vector<vector<string>> printTree(TreeNode* root) {
int h = height(root);
int c = pow(2, h) - 1;
vector<vector<string>> ans(h, vector<string>(c));
dfs(root, 0, c-1, 0, ans);
return ans;
}
private:
int height(TreeNode* root) {
if (root == NULL) return 0;
return max(height(root->left), height(root->right)) + 1;
}
void dfs(TreeNode* root, int l, int r, int h, vector<vector<string>>& ans) {
if (root == NULL) return;
if (l > r) return;
int mid = (l + r) / 2;
ans[h][mid] = to_string(root->val);
dfs(root->left, l, mid-1, h+1, ans);
dfs(root->right, mid+1, r, h+1, ans);
}
};
``````