✦ LIBER ✦

A note on the reconstruction of a binary tree from its traversals

✍ Scribed by Naveen Gabrani; Priti Shankar

Book ID: 107766036
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 240 KB
Volume: 42
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90100-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructing a binary tree from its trav

Constructing a binary tree from its traversals

✍ Erkki Mäkinen 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 192 KB

Reconstructing a Binary Tree from Its Tr

Reconstructing a Binary Tree from Its Traversals in Doubly Logarithmic CREW Time

✍ S. Olariu; M. Overstreet; Z.F. Wen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 508 KB

A note on traversal algorithms for tripl

A note on traversal algorithms for triply linked binary trees

✍ T. I. Fenner; G. Loizou 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 173 KB

Construction of a tree from its traversa

Construction of a tree from its traversals in optimal time and space

✍ Arne Andersson; Svante Carlsson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 430 KB

The reconstruction of a tree from its nu

The reconstruction of a tree from its number deck

✍ I Krasikov; J Schönheim 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Those trees are characterized which are reconstructible f~om the knowledge of the sizes of the connected components in each maximal subgraph. II est connu que la conjecture de Ulam est vraie pour les arbres. Dam un language d~ Harary ceci s'exprime de la fa~n suivante: Si les n for6ts, qu'on a obt

A note on binary grammatical codes of tr

A note on binary grammatical codes of trees

✍ Andrzej Ehrenfeucht; Paulien ten Pas; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 916 KB