Implementation of Morris Traversal of a binary tree. Morris traversal is an in-order traversal without recursion (i.e. using O(1) space), which leverages threading. Time-complexity is O(n), where n is the number of nodes.
Usage: morris-traversal <int>...