LeetCode655.Print Binary Tree(java实现)

  • 问题描述

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”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”, “”]]

  • 解决方案

递归解决,代码如下:

public List<List<String>> printTree(TreeNode root) {
        
        List<List<String>> res = new ArrayList<>();
        int m = getHeight(root);
        int n = (int)Math.pow(2,m) - 1;
        for(int i = 0;i < m;i ++){
            List<String> list = new ArrayList<String>();
            for(int j = 0;j < n; j++)
                list.add("");
            res.add(list);
        }
         help(root,1,0,n,res); 
        return res;
    }
    
    
    public static void help(TreeNode root,int height,int left,int right,List<List<String>> res){
        if(root == null)
            return;
        List<String> list = res.get(height - 1);
        int mid = (left + right) >> 1;
        list.set(mid,root.val + "");
        if(root.left != null || root.right != null){
            help(root.left,height + 1,left,mid,res);
            help(root.right,height + 1,mid,right,res); 
        }
       
    }
    
    public static int getHeight(TreeNode root){
        if(root == null)
            return 0;
        return Math.max(getHeight(root.left),getHeight(root.right)) + 1;
    }
展开阅读全文
©️2020 CSDN 皮肤主题: 黑客帝国 设计师: 上身试试 返回首页
实付0元
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、C币套餐、付费专栏及课程。

余额充值