Valid

public class Solution {
    public List<ListNode> binaryTreeToLists(TreeNode root) {
        List<ListNode> res = new ArrayList<>();
        if(root == null) {
            return res;
        }

        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);

        while(!queue.isEmpty()) {
            int levelNum = queue.size();
            ListNode dummy = new ListNode(-1);
            ListNode tmp = dummy; //tmp -- the last ListNode
            for(int i = 0; i < levelNum; ++i) {
                TreeNode out = queue.poll();
                pre.next = new ListNode(out.val);
                pre = pre.next;
                if(out.left != null) {
                    queue.offer(out.left);
                }
                if(out.right != null) {
                    queue.offer(out.right);
                }
            }
            res.add(dummy.next);
        }
        return res;
    }
}

评论

暂无评论