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", "",  "", "",  "", "", "", "",  "",  "",  "",  "",  "", "", ""]]

Note: The height of binary tree is in the range of [1, 10].

将二叉树输出成m * n二维数组

行数m等于二叉树的高度

列数n总是奇数

根节点位于首行正中间，将其下的空间分成左右两半。递归此过程。

let Tree = require('../Helper/Javascript/Tree').Tree;
/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {string[][]}
 */
var printTree = function (root) {
    let rowNum = maxDepth(root);
    let colNum = Math.pow(2, rowNum - 1) * 2 - 1;
    let res = [];
    for (let i = 0; i < rowNum; i++) {
        res[i] = [];
        for (let j = 0; j < colNum; j++) {
            res[i][j] = "";
        }
    }
    setNodeNum(root, res, 0, 0, colNum);
    return res;
};
var setNodeNum = function (node, res, depth, left, right) {
    if (!node) return;
    let mid = Math.floor((left + right) / 2);
    res[depth][mid] = String(node.val);
    setNodeNum(node.left, res, depth + 1, left, mid);
    setNodeNum(node.right, res, depth + 1, mid, right);
}
var maxDepth = function (root) {
    if (!root) return 0;
    let left = maxDepth(root.left);
    let right = maxDepth(root.right);
    return Math.max(left, right) + 1;
}
// let root = Tree.CreateTree([1, 2, 5, 3, null, null, null, 4, 5]);
// console.log(printTree(root));

来自为知笔记(Wiz)