Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Rust: Real-World Examples

Binary Tree Zigzag Level Order Traversal

Explore how to implement zigzag level order traversal in a binary tree using Rust. Understand the use of breadth-first search combined with a deque to alternate node processing order per level. Gain insights into the algorithm's time and space complexity to prepare for coding interviews involving tree traversal problems.

We'll cover the following...

Description

Given a binary tree T, you have to find its nodes’ zigzag level order traversal. The zigzag level order traversal corresponds to traversing nodes from left to right and then right to left for the next level, alternating between.

You have to return the elements in each level in a two-dimensional array.

Let’s look at an example:

Do it yourself

Rust 1.57.0
fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>)-> Vec<Vec<i32>> {
    return vec![];        
}

Solution

As per the problem statement, we need to traverse the tree in a level-by-level zigzag order. An intuitive approach for this problem would be to use Breadth-First Search (BFS). By default, BFS provides ordering from left to right within a single level.

We will need to modify BFS a little to get our desired output, a zigzagzigzag ...