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

Iterator of mutable references over a hashmap

Users Rust Lang · Aug 16, 2026

Rust HashMap

How should Futhark expose irregular arrays to the programmer?

Futhark Lang · Aug 12, 2026

Futhark programming-languages

Graph neural networks are turning hidden fraud into visible networks

Siliconangle · Aug 10, 2026

AI Cube Event Coverage

Introducing FILE type: a native column type for multimodal data

Mooncake · Aug 7, 2026

Platform Multimodal Data

Discover more posts →

AUTHOR