[LeetCode] 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].
输入是一个二叉树，要求将二叉树的打印到一个二维数组中，二维数组每行对应二叉树的每行，二维数组行数对应二叉树的高度。
解决思路是首先求得二叉树的高度，提前分配出二维数组，然后递归二叉树在二维数组中位置填写数值。递归每向下一次，二维数组中的行的位置就加一，列的位置是每次区间的中间值。如果是递归左子树的话就是左半区间，如果递归右子树的话就是右半区间。

C++ 实现

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<string>> printTree(TreeNode* root) {
        if (!root)
        {
            return vector<vector<string>>{};
        }
        const size_t row = getTreeHeight(root);
        const size_t col = (1 << row) - 1;
        vector<vector<string>> res(row, vector<string>(col, ""));
        populateTree(root, row, 0, 0, col - 1, res);
        return res;
    }
private:
    size_t getTreeHeight(const TreeNode* root)
    {
        if (root == NULL)
        {
            return 0;
        }
        return 1 + max(getTreeHeight(root->left), getTreeHeight(root->right));
    }

    void populateTree(const TreeNode* root,
                      const size_t max_row,
                      const size_t row,
                      const size_t left,
                      const size_t right,
                      vector<vector<string>>& res)
    {
        if (!root || row == max_row)
        {
            return;
        }
        res[row][(left + right) >> 1] = to_string(root->val);
        populateTree(root->left, max_row, row + 1, left, ((left + right) >> 1) - 1, res);
        populateTree(root->right, max_row, row + 1, ((left + right) >> 1) + 1, right, res);
    }
};