FilesExpand file tree

 master

/

Solution32_2.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (32 loc) · 1.01 KB

 master

/

Solution32_2.java

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (32 loc) · 1.01 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

package com.usher.algorithm.offer;

import java.util.ArrayList;

import java.util.LinkedList;

import java.util.Queue;

/**

* @Author: Usher

* @Description:

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

*/

public class Solution32_2 {

ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {

ArrayList<ArrayList<Integer>> ret = new ArrayList<>();

if (pRoot == null)

return ret;

Queue<TreeNode> queue = new LinkedList<>();

queue.add(pRoot);

while (!queue.isEmpty()){

ArrayList<Integer> list = new ArrayList<>();

int size = queue.size();

for (int i =0;i < size;i++){

TreeNode node = queue.poll();

list.add(node.val);

if (node.left != null)

queue.add(node.left);

if (node.right != null)

queue.add(node.right);

}

ret.add(list);

}

return ret;

}

}