Leetcode 429. N-ary Tree Level Order Traversal

Input: root = [1,null,3,2,4,null,5,6]
Output: [[1],[3,2,4],[5,6]]
Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]

--

--

--

CS new grad, 6 years experience related to supply chain management. Located in Bay area

Love podcasts or audiobooks? Learn on the go with our new app.

Costly V/s Cheap / Freemium

How to Reach Inbox Zero, Automatically, Every Day

To Code or not to Code… is that even a question?

Qnap Turbo Nas User Manual 4.3

Why You Should Consider Best-of-Breed Software

Ada and Dishes [ADADISH](Solution)

MakeCode for Minecraft update

10 Best Tools For Cross-Platform Mobile App Development in 2017

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Gary Chiang

Gary Chiang

CS new grad, 6 years experience related to supply chain management. Located in Bay area

More from Medium

An Introduction to Linked Lists

Leetcode Solutions

Data Structure — Linked List

Leetcode 452. Minimum Number of Arrows to Burst Balloons