Binary Tree Inorder Traversal Algorithm (in Rust)

In this video we work off the Binary Search Tree to implement an inorder order traversal algorithm in Rust (both iterative and recursive functions). We build on previous videos to extend the functionality of the binary tree struct. We still make use of the ref patterns, as_ref to handle the Option references and make use of a simple Vec to handle a stack for processing nodes.

**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

[dragonmax]

Very nice, please keep up the good work, much appreciate that.