<easy>LeetCode Problem -- 655. Print Binary Tree

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

1.The row number m should be equal to the height of the given binary tree.
2.The column number n should always be an odd number.
3.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.
4.Each unused space should contain an empty string “”.
5.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”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”]]

• 分析：要求将一棵树用数组的形式可视化表示出来。并遵守以下规则：
  1.行数为树的高度。
  2.列数n为奇数。
  3.根节点在第一行的正中央位置，左下部分和右下部分大小相同。对于空节点，如果左右子树有一个为空，则给空的那个子树预留位置，如果两个子树为空，则不给这两个子树预留位置。
  4.没有用到的空间用空串”“填充。
  5.子树的构建遵守上述规则。

• 思路一：dfs深度优先搜索。首先，由题目中给的规则三可以分析出这个数组行和列之间的关系，设行数为m，列数为n，则有n = 2^m - 1，知道这个关系之后用bfs对于每个元素计算出它对应的位置，填入数组中就可以了。

class Solution {
public:
    vector<vector<string>> printTree(TreeNode* root) {
        int h = getDepth(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 getDepth(TreeNode* cur) {
        if (cur == NULL) return 0;
        return max(getDepth(cur -> right), getDepth(cur -> left)) + 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);
    }
};