Binary Tree Level Traversal Algorithm (in Rust)

preview_player
Показать описание
In this video we work off the Binary Search Tree to implement a level order traversal algorithm in Rust. We use a VecDequeue from the standard library to manage our processing as we iterate in a breadth first search approach. Also, we make use of the ref pattern for capturing a reference from an unwrapped Option. Finally we will use the level order traversal function to also calculate the height of the tree.

**NOTES**
This video does build off of the previous Binary Search Tree: Insertion video. So if you haven't watched that video go check it out here:

↠ References:

Cheers! 🍻

🦀 #rust #rustlang #rustprogramming #exercises #leetcode #programming
Рекомендации по теме
Комментарии
Автор

Thanks for this, doing god's work.

cyanfroste
Автор

Can you share the source code you write in these videos?

korigamik
join shbcf.ru