Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Space Requirements for Tree Traversal. Parent comment
For converting binary tree into a linked list in O(n) time and O(1) space.
You have two pointers, the root and the tail (right child node).
If root has a left subtree, set tail->right = left subtree. Update tail again so it is the last right child node.
root = root->right
Repeat until root is NULL
For converting binary tree into a linked list in O(n) time and O(1) space.
You have two pointers, the root and the tail (right child node).
If root has a left subtree, set tail->right = left subtree. Update tail again so it is the last right child node.
root = root->right
Repeat until root is NULL