【二叉树】把二叉树打印成多行

1、把二叉树打印成多行

题目描述

从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。

import java.util.ArrayList;
import java.lang.Integer;
import java.lang.Math;
 
 
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
 
    public TreeNode(int val) {
        this.val = val;
 
    }
 
}
*/
public class Solution {
    public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        if(null == pRoot){
            return new ArrayList<ArrayList<Integer>>();
        }
         
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        int length = getLength(pRoot);
        for(int i = 1; i <= length; i++){
            ArrayList<Integer> rows = new ArrayList<Integer>();
            print(pRoot, i, rows);
            result.add(rows);
        }
         
        return result;
    }
     
    private void print(TreeNode node, int length, ArrayList<Integer> rows){
        if(null == node || length <= 0){
            return;
        }
        if(length == 1){
            rows.add(node.val);
            return;
        }
         
        print(node.left, length -1, rows);
        print(node.right, length - 1, rows);
    }
     
    private int getLength(TreeNode pRoot){
        if(null == pRoot){
            return 0;
        }
         
        int left = getLength(pRoot.left);
        int right = getLength(pRoot.right);
        return Math.max(left, right) + 1;
    }
}

 

2、按之字形顺序打印二叉树

题目描述

请实现一个函数按照之字形打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右至左的顺序打印，第三行按照从左到右的顺序打印，其他行以此类推。

import java.util.ArrayList;

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        if(null == pRoot){
            return new ArrayList<ArrayList<Integer>>();
        }
         
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        int length = getLength(pRoot);
        for(int i = 1; i <= length; i++){
            ArrayList<Integer> rows = new ArrayList<Integer>();
            print(pRoot, i % 2 != 0 , i, rows);
            result.add(rows);
        }
         
        return result;
    }
    
    private void print(TreeNode node, boolean beginLeft, int length, ArrayList<Integer> rows){
        if(null == node || length <= 0){
            return;
        }
        if(length == 1){
            rows.add(node.val);
            return;
        }
        
        if(beginLeft){
            print(node.left, beginLeft, length -1, rows);
            print(node.right, beginLeft, length - 1, rows);
        }else{
            print(node.right, beginLeft, length - 1, rows);
            print(node.left, beginLeft, length - 1, rows);
        }
    }
     
    private int getLength(TreeNode pRoot){
        if(null == pRoot){
            return 0;
        }
         
        int left = getLength(pRoot.left);
        int right = getLength(pRoot.right);
        return Math.max(left, right) + 1;
    }

}