DIY: Binary Tree Level Order Traversal
Explore how to implement a binary tree level order traversal by coding a function that returns node values grouped by tree levels. Understand how to break down tree data structures and practice a common interview problem using Elixir.
We'll cover the following...
We'll cover the following...
Problem statement
Given a binary tree, populate an array to represent its level-by-level traversal. You should populate the values of each levels’ nodes from left to right in ...