655. Print Binary Tree**

最新推荐文章于 2024-02-27 16:31:50 发布

珍妮的选择

最新推荐文章于 2024-02-27 16:31:50 发布

阅读量286

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/104626010

LeetCode 专栏收录该内容

416 篇文章

订阅专栏

本文详细解析了LeetCode上的第655题“Print Binary Tree”，探讨了如何将二叉树以二维字符串数组的形式进行打印，确保行数等于树的高度，列数为奇数，并保持根节点在每行正中间。提供了两种C++实现方法，一种通过递归，另一种采用层序遍历，同时强调了代码中易错点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

655. Print Binary Tree**

https://leetcode.com/problems/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.

C++ 实现 1

递归版本. 首先注意观察返回结果中, 矩阵大小 m * n 和树的高度 h 的关系. 其中 m = h, 而 n = 2^h - 1. 那么可以先确定树的高度, 得到矩阵的大小. 之后再确定树中每个节点的值在矩阵中的位置. 我不知道这里怎么清楚的描述, 任意以个节点处在两棵子树的中心位置. 用 left 和 right 来确定左右子树的范围, 用 mid = (left + right) / 2 来确定节点的位置. 在递归过程中, 维护 left 和 right.

class Solution {
private:
    int height(TreeNode *root) {
        if (!root) return 0;
        return std::max(height(root->left), height(root->right)) + 1;
    }
    void build(TreeNode *root, int row, int left, int right,
              vector<vector<string>> &res) {
        if (!root) return;
        int mid = left + (right - left) / 2;
        res[row][mid] = std::to_string(root->val);
        build(root->left, row + 1, left, mid - 1, res);
        build(root->right, row + 1, mid + 1, right, res);
    }
public:
    vector<vector<string>> printTree(TreeNode* root) {
        if (!root) return {};
        int layers = height(root);
        int cols = int(std::pow(2, layers)) - 1;
        vector<vector<string>> res(layers, vector<string>(cols, ""));
        int left = 0, right = cols - 1;
        build(root, 0, left, right, res);
        return res;
    }
};

C++ 实现 2

使用层序遍历也可以完成, 第一部仍然是求出树的高度. 在队列中维护节点本身以及它的左右范围.

class Solution {
private:
    int height(TreeNode *root) {
        if (!root) return 0;
        return std::max(height(root->left), height(root->right)) + 1;
    }
public:
    vector<vector<string>> printTree(TreeNode* root) {
        if (!root) return {};
        int layers = height(root);
        int cols = int(std::pow(2, layers)) - 1;
        vector<vector<string>> res(layers, vector<string>(cols, ""));
        int row = -1;
        queue<pair<TreeNode*, vector<int>>> q;
        q.push(make_pair(root, vector<int>{0, cols - 1}));
        while (!q.empty()) {
            auto size = q.size();
            row ++;
            while (size --) {
                auto p = q.front();
                q.pop();
                auto r = p.first;
                auto left = p.second[0];
                auto right = p.second[1];
                int mid = left + (right - left) / 2;
                res[row][mid] = std::to_string(r->val);
                if (r->left) 
                    q.push(make_pair(r->left, vector<int>{left, mid - 1}));
                if (r->right) 
                    q.push(make_pair(r->right, vector<int>{mid + 1, right}));
            }
        }
        return res;
    }
};

题外话, 如下作为警示, 写代码的时候, 把其中一段代码写成:

res[row][mid] = std::to_string(root->val);
if (root->left) 
    q.push(make_pair(root->left, vector<int>{left, mid - 1}));
if (root->right) 
    q.push(make_pair(root->right, vector<int>{mid + 1, right}));