#
DIFF.BLOG
New
Following
Discover
Jobs
More
Top Writers
Suggest a blog
Upvotes plugin
Report bug
Contact
About
Privacy
Sign up
The home for great developer writing.
We surface the best developer writing from thousands of independent blogs, updated daily.
Join Diff.blog
TOPICS
Non-recursively deleting a binary tree in constant space: Rotating the tree
·
Raymond Chen
·
Nov. 12, 2025, 3:10 p.m.
Old New Thing
Code
data-structures
binary-trees
Algorithm Optimization
in-order traversal
Summary
The blog post discusses a method for non-recursively deleting a binary tree in constant space with a focus on preserving in-order traversal while modifying the tree structure.
Read full post on devblogs.microsoft.com →
MORE POSTS LIKE THIS
Non-recursively deleting a binary tree in constant space: Restructuring the tree
Raymond Chen ·
Nov 7, 2025
Old New Thing
Code
Dijkstra's Algorithm in Go: Implementation, Optimization, and Real-World Use
Manuel Fedele ·
Nov 5, 2026
graph-theory
data-structures
Encountered invalid memory reference while removing nodes
Users Rust Lang ·
Oct 30, 2026
programming
Rust
The Underappreciated Art of Superposition Masking
Craig Gidney ·
Oct 22, 2026
Quantum Computing
Algorithm Optimization
Objects, attributes, maps, oh my!
tekknolagi ·
Oct 21, 2026
Python
Javascript
No File System Is Fit For Purpose
Adrian Kosmaczewski ·
Oct 5, 2026
computer-science
data-structures
Discover more posts →
AUTHOR
RECENT POSTS FROM THE AUTHOR
Choose how you want to continue.
Continue with GitHub
Continue with Google
By continuing, you agree to our
Privacy Policy
.