package SwordOffer;
import java.util.ArrayList;
import java.util.List;
/**
* @Description: 从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回:
[3,9,20,15,7]
提示:
节点总数 <= 1000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
* @Param:
* @return:
* @Author: lvhong
* @Date:
* @E-mail lvhong282@163.com
*/
public class lab32middium {
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
//BFS 借助QUEUE
// public int[] levelOrder(TreeNode root) {
// if (root==null) {
// return new int[0];
// }
// Queue<TreeNode> que = new LinkedList<>();
// que.add(root);
// ArrayList<Integer> list=new ArrayList<>();
// while(!que.isEmpty()){
// TreeNode node=que.poll();
// list.add(node.val);
// if(node.left!=null) {
// que.add(node.left);
// }
// if(node.right!=null) {
// que.add(node.right);
// }
// }
// int []out = new int[list.size()];
// for(int i=0;i<list.size();i++){
// out[i]=list.get(i);
// }
// return out;
// }
//DFS 递归
public int[] levelOrder(TreeNode root) {
List<List<Integer>> list = new ArrayList<>();
levelHelper(list, root, 0);
List<Integer> tempList = new ArrayList<>();
for (int i = 0; i < list.size(); i++) {
tempList.addAll(list.get(i));
}
//把list转化为数组
int[] res = new int[tempList.size()];
for (int i = 0; i < tempList.size(); i++) {
res[i] = tempList.get(i);
}
return res;
}
public void levelHelper(List<List<Integer>> list, TreeNode root, int height) {
if (root == null)
return;
if (height >= list.size()) {
list.add(new ArrayList<>());
}
list.get(height).add(root.val);
levelHelper(list, root.left, height + 1);
levelHelper(list, root.right, height + 1);
}
}