dsa2 min read
Flatten Binary Tree to Linked List — Morris Traversal
Flatten a binary tree in-place into a linked list following pre-order using the Morris traversal approach.
Read →
All Posts
1276 articles
dsa1 min read
Convert Sorted List to BST — Fast/Slow + Recursion
Convert a sorted linked list to a height-balanced BST by repeatedly finding the middle node as root.
Read →
dsa2 min read
Reverse Nodes in k-Group — Recursive Group Reversal
Reverse every k nodes of a linked list recursively: check k nodes exist, reverse them, recurse on the rest.
Read →
dsa2 min read
Merge K Sorted Lists — Min-Heap or Divide and Conquer
Merge k sorted linked lists into one sorted list using a min-heap for O(n log k) time complexity.
Read →
dsa2 min read
Sort List Bottom-Up — O(1) Space Merge Sort
Sort a linked list in O(n log n) time and O(1) space using bottom-up merge sort with doubling sublist sizes.
Read →
Page 83 of 256