The home for great developer writing.

We surface the best developer writing from thousands of independent blogs, updated daily.

Non-recursively deleting a binary tree in constant space: Rotating the tree

1 · Raymond Chen · Nov. 12, 2025, 3:10 p.m.

Old New Thing Code binary-trees Algorithm Optimization in-order traversal data-structures

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

Implementing Dijkstra’s Algorithm in Go

Manuel Fedele · Nov 27, 2024

Dijkstra's Algorithm graph-theory

Production ML-DSA Verification in 350 Lines of Python

Filippo Valsorda · Jul 26, 2026

Machine Learning data-structures

Production ML-DSA Verification in 350 Lines of Python

Filippo Valsorda · Jul 26, 2026

Machine Learning data-structures

Arctic: a lock-free concurrent ordered map (OSDI '26)

Users Rust Lang · Jul 22, 2026

Rust concurrent programming

Profunctor Optics

Bartoszmilewski · Jul 19, 2026

Category theory Haskell

Discover more posts →

AUTHOR