leetcode 102 java_Solution102.java

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

*/

/**

* BFS

* https://leetcode.com/submissions/detail/337320957/

*/

class Solution {

public List> levelOrder(TreeNode root) {

List> result = new ArrayList<>();

if (root == null) {

return result;

}

Queue queue = new LinkedList<>();

queue.offer(root);

while (!queue.isEmpty()) {

List list = new ArrayList<>();

int size = queue.size();

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

TreeNode node = queue.poll();

list.add(node.val);

TreeNode left = node.left;

if (left != null) {

queue.offer(left);

}

TreeNode right = node.right;

if (right != null) {

queue.offer(right);

}

}

result.add(list);

}

return result;

}

}

一键复制

编辑

Web IDE

原始数据

按行查看

历史