Constructing a binary tree efficiently from its traversals

Authors
Makinen, E
Citation
E. Makinen, Constructing a binary tree efficiently from its traversals, INT J COM M, 75(2), 2000, pp. 143-147
Citations number
4
Categorie Soggetti
Engineering Mathematics
Journal title
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
ISSN journal
00207160 → ACNP
Volume
75
Issue
2
Year of publication
2000
Pages
143 - 147
Database
ISI
SICI code
Abstract
In this note we streamline an earlier algorithm for constructing a binary t ree from its inorder and preorder traversals. The new algorithm is conceptu ally simpler than the earlier algorithms and its time complexity has a smal ler constant factor.