Binary-tree

2 articles

dsa7 min read

Flatten Binary Tree to Linked List — Morris-Style In-Place Explained

Learn three ways to flatten a binary tree to a pre-order linked list in-place, including the O(1) space Morris-style approach. A classic interview problem at Microsoft, Amazon, and Google that bridges tree and linked list manipulation.

April 29, 2026Read →

dsa8 min read

Kth Largest Sum in a Binary Tree — BFS Level Sums with Heap Selection

Find the kth largest level sum in a binary tree by computing all level sums with BFS and selecting the kth largest using a min-heap — a clean combination of BFS and heap selection.

March 19, 2026Read →