blog | sven kanoldt

I have about 40 aliases. Half of them only make sense in specific projects. The other half clash with each other depending on what I'm working on. And all of them live in my dotfiles, loaded into every shell session whether I need them or not.

You built a Rust GUI app. It compiles. It runs on your machine. You send the binary to a friend, they double-click it, and macOS says: "Apple could not verify this app." Right-click, Open, confirm the scary dialog — it works. But that's not a shipping experience.

With versions 0.7.11 through 0.8.1, t-rec gained several features that make terminal recordings more configurable and visually appealing. If you don't know t-rec yet: it's a terminal recorder written in Rust that captures your terminal session and outputs a GIF or MP4. Here's what's new.

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.