Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion

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.

• Type: Conference
• Year: 2003
• Where: APLAS
• Authors: Shin-Cheng Mu, Richard S. Bird
• Keywords: APLAS 2003, Binary Tree, Function Inversion, Preorder Traversal