Sciweavers

Share
APLAS
2003
ACM

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

9 years 7 months ago
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.
Shin-Cheng Mu, Richard S. Bird
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where APLAS
Authors Shin-Cheng Mu, Richard S. Bird
Comments (0)
books