blog | sven kanoldt

In the previous article, I covered a level-order traversal of a binary tree in Rust. This time, I want to take on a classic problem from LeetCode #98: Validate Binary Search Tree.

Mastering LeetCode 102: Binary Tree Level Order Traversal with a BFS approach in Rust, leveraging Rc, RefCell, and VecDeque for efficient tree traversal.

In this post, we will explore the CIDR trie data structure and how it can help you manage IP addresses and subnets in your Rust project.

For-i loops are somewhat out, so let's rethink nested and specifically correlated loops in a functional style in Javascript.