Its usually easier to traverse if graph is stored in an adjacency list.
why we dont use that approach? is it less efficient for binary tree?
Course: Grokking the Coding Interview: Patterns for Coding Questions - Learn Interactively
Lesson: Binary Tree Level Order Traversal (easy) - Grokking the Coding Interview: Patterns for Coding Questions