Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Trees

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Trees

Binary Tree Level Order Traversal

beginnerlayer I1 · Trees5 tests

Return the values of a binary tree grouped by depth: one inner array per level, each read left to right, starting at the root.

  • For [3,9,20,null,null,15,7] the answer is [[3],[9,20],[15,7]]
  • An empty tree gives []
  • Levels with missing children simply contain fewer values

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen