Leetcode--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.

思路

观察发现，树的高度为depth，最大宽度为2^depth-1，首先应求树的高度，然后用递归的方式将当前结点值写到数组中即可。

代码

class Solution {
public:
    vector<vector<string> > printTree(TreeNode* root) {
        vector<vector<string> > ret;
        if(!root)
            return ret;
        int depth = getDepth(root)-1;
        int width = (2<<depth)-1;
        vector<vector<string> > res(depth+1, vector<string>(width, ""));
        getRes(root, res, 0, depth, 0, width);
        return res;
    }

    void getRes(TreeNode* root, vector<vector<string> > &res, int curDepth, int depth, int left, int right) {
        if(curDepth > depth || !root || left > right)
            return;
        int mid = left+(right-left)/2;
        char c[8];
        string val = itoa(root->val, c, 10);
        res[curDepth][mid] = val;
        if(root->left)
            getRes(root->left, res, curDepth+1, depth, left, mid-1);
        if(root->right)
            getRes(root->right, res, curDepth+1, depth, mid+1, right);
    }

    int getDepth(TreeNode* root) {
        if(!root) return 0;
        return max(getDepth(root->left), getDepth(root->right)) + 1;
    }
};