Xuanken Tay

Software engineer who likes statistics, machine learning, DevOps and the cloud

less than 1 minute read

Given a binary tree root, convert it to a singly linked list using level order traversal.

Constraints

  • 1 ≤ n ≤ 100,000 where n is the number of nodes in root

https://binarysearch.com/problems/Level-Order-Binary-Tree-to-Linked-List

Examples

Example 1

Input

  • root =

Output

  • answer =

Example 2

Input

  • root =

Output

  • answer =

Solution

Leave a comment

Read more

Top View of a Tree

less than 1 minute read

Given a binary tree root, return the top view of the tree, sorted left-to-right.

Leaves in Same Level

less than 1 minute read

Given a binary tree root, return whether all leaves are at the same level.

Level Order Traversal

less than 1 minute read

Given a binary tree root return a level order traversal of the node values.

Level Order Alternating

less than 1 minute read

Given a binary tree root, return values of the nodes in each level, alternating from going left-to-right and right-to-left.