Leetcode - Episode 15 - Three Tree Qs (3 x E)

from blog Andrew Healey's Blog, | ↗ original
Solutions for: Invert Binary Tree, N-ary Tree Postorder Traversal, and N-ary Tree Preorder Traversal.
This is a short summary. ↗ Open original to view full content

Related

Tricks of the trade: Recursion to Iteration, Part 3: Recursive Data Structures
Tom Moertel's Blog | original ↗
What is a binary tree and why would I ever want to reverse it
Frederick's delirious rantings | original ↗
Coupled Code is Cool
NULL BITMAP by Justin Jaffray | original ↗
Tricks of the trade: Recursion to Iteration, Part 4: The Trampoline
Tom Moertel's Blog | original ↗
Lenses for Tree Traversals
Terms and Truth-Conditions | original ↗
Computing Integer Roots
Fred Akalin | original ↗
Tricks of the trade: Recursion to Iteration, Part 1: The Simple Method, secret features, and accumulators
Tom Moertel's Blog | original ↗
Of Boxes and Trees - Smart Pointers in Rust
Matthias Endler | original ↗
Tricks of the trade: Recursion to Iteration, Part 2: Eliminating Recursion with the Time-Traveling Secret Feature Trick
Tom Moertel's Blog | original ↗
Logic Colloquium 2005 Day 3
Home on consequently.org | original ↗

More from Andrew Healey's Blog

Building Game Prototypes with LÖVE
31 Dec 2024 | original ↗

Chess, card games, and Lua.

Compiling Lisp to Bytecode and Running It
15 Oct 2024 | original ↗

Extending my Lisp compiler and adding a fast virtual machine.

Generating Mazes
8 Aug 2024 | original ↗

Visualizations and techniques for different maze generation algorithms.

Making Python Less Random
8 Jul 2024 | original ↗

Using ptrace to intercept and modify a process's getrandom syscall.

2D Multiplayer From Scratch
30 Jun 2024 | original ↗

Exploring patterns and systems for creating realtime browser games.