Morris Traversal is a technique to traverse a binary tree without using additional space for a stack or recursion.
This animation shows how Morris Traversal can be used to find the median in a Binary Search Tree (BST).
Step 1 of 15
Initial Binary Search Tree with nodes {4,2,6,1,3,5,7}. Morris Traversal will help us find the median by traversing the tree without using extra space.