655. Print Binary Tree
来源:互联网 发布:淘宝女装修图教程 编辑:程序博客网 时间:2024/05/17 03:28
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 / 2Output:[["", "1", ""], ["2", "", ""]]
Example 2:
Input: 1 / \ 2 3 \ 4Output:[["", "", "", "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].
思路:可以找出树的高度,由树的高度可以推出二维数组的列数,从而使用DFS进行遍历修改二维数组的元素;
int height_Tree(TreeNode* root){ if (!root)return 0; int left = height_Tree(root->left); int right = height_Tree(root->right); return max(left, right) + 1;}void helper(vector<vector<string>>& res, TreeNode* root, int level, int l, int r){ if (!root)return; int mid = l + (r - l) / 2; res[level][mid] = to_string(root->val); helper(res, root->left, level + 1, l, mid - 1); helper(res, root->right, level + 1, mid + 1, r);}vector<vector<string>> printTree(TreeNode* root) { if (!root)return vector<vector<string>>{}; int height = height_Tree(root); int cols = pow(2, height) - 1; vector<vector<string>> res(height, vector<string>(cols, "")); helper(res, root, 0, 0, cols - 1); return res;}
阅读全文
0 0
- 655. Print Binary Tree
- 655. Print Binary Tree
- 655. Print Binary Tree
- 655. Print Binary Tree
- 655. Print Binary Tree
- Leetcode--655. Print Binary Tree
- leetcode 655. Print Binary Tree
- Pretty print binary tree
- print binary tree boundary
- Print binary tree
- Leetcode655. Print Binary Tree
- LeetCode Print Binary Tree
- Print Binary Tree
- LeetCode_655. Print Binary Tree
- clockwise print binary search tree
- Leetcode 655. Print Binary Tree 打印二叉树 解题报告
- leetcode 655. Print Binary Tree 深度优先遍历DFS
- Print Boundry Nodes of a binary tree.
- 如何定义数组
- 进制转换
- 友盟登录+xlistview+slidingview+xutils_post请求数据
- http 漏洞解决办法
- Java进阶06 容器
- 655. Print Binary Tree
- HDU-3280---Equal Sum Partitions (暴力)
- 【Spring MVC】--介绍
- spring-http-Hessian-rpc示范
- easyUI datagrid 前端假分页
- 扩展虚拟机的系统分区
- 失踪的7
- CodeForces 835 B.The number on the board(贪心)
- C语言排序之选择排序篇