| Rebuilding a Tree From Its Traversals: A Case Study of Program Inversion (2003) | |||||||||||||||
Abstract | |||||||||||||||
| Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding the tree in a functional framework, using existing theory on function inversion. We also present a new, although complicated, algorithm by trying another possibility not explored before. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||