|
|||||
|
|
Constructing a binary tree from its traversals |
|
| Authors: | Erkki Mäkinen |
| Affiliation: | (1) Department of Computer Science, University of Tampere, P.O. Box 607, SF-33101 Tampere, Finland |
| Abstract: | This paper shows that a binary tree can be constructed from its preorder and inorder traversals in linear time and space. |
| Keywords: | E.1 |
| 本文献已被 SpringerLink 等数据库收录！ | |