/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
helper(res, root, 0);
return res;
}
private void helper(List<List<Integer>> list, TreeNode node, int level) {
if (node == null){
return;
}
if ( level == list.size()){
list.add(new ArrayList<>());
}
list.get(level).add(node.val);
helper(list, node.left, level + 1);
helper(list, node.right, level + 1);
}
}
leetcode.cn_二叉树的层序遍历_102
最新推荐文章于 2024-07-22 16:27:42 发布