APLAS
2003
ACM
14 years 19 days ago
2003
ACM
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 ...