Constructing a binary tree from its traversals by reversible recursion and iteration

•Binary tree construction algorithms are obtained from reversible tree traversals.•The recursive and iterative algorithms are linear time and space in the tree size.•A reversible programming discipline is shown to solve Knuth's classical problem.