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 →
Morris
2 articles
dsa2 min read
Recover Binary Search Tree
Find and swap the two misplaced nodes in a BST using in-order traversal to detect the violations.
Read →