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.

Setting up Azure’s P2S VPN Gateway with PowerShell -Part 1/3

Extract Facebook and Twitter data from any page

Method to super-boost productivity

7 Tips to Improve Your Technical Writing Skills

The Best Hybrid Mobile App Development Framework

https://www.coinbase.com/earn/the-graph/lesson/1

OpenPaaS Newsletter 7 - September 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

Leetcode 8. String to Integer (atoi)

Binary Tree (DFS application)

Understanding Topological Sorting with Kahn’s Algo

String to Integer (atoi) — LeetCode Solutions