Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

APLAS
2003
ACM

favoriteEmaildiscussreport

100views Programming Languages» more APLAS 2003»

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

13 years 9 months ago

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

Download www.comlab.ox.ac.uk

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

Real-time Traffic

APLAS 2003 | Binary Tree | Function Inversion | Preorder Traversal |

claim paper

Related Content

» The Sketch of a Polymorphic Symphony

» A framework for rapid systemlevel exploration synthesis and programming of multimedia MPSo...

» InduceStatements and InduceExpressions Constructs for Inductive Programming

» Scaling Up Inductive Logic Programming by Learning from Interpretations

» GUI Ripping Reverse Engineering of Graphical User Interfaces for Testing

» Learning Techniques for Automatic Algorithm Portfolio Selection

» Game Solution Epistemic Dynamics and FixedPoint Logics

» Maximizing aggregated revenue in sensor networks under deadline constraints

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	APLAS
Authors	Shin-Cheng Mu, Richard S. Bird

Comments (0)