✦ LIBER ✦

Inversion of a recursive tree traversal

✍ Scribed by Jan L.A. van de Snepscheut

Book ID: 107765942
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 309 KB
Volume: 39
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90026-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bounded-space tree traversal algorithm

✍ D.S. Hirschberg; S.S. Seiden 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Vectorization of tree traversals

✍ Lars Hernquist 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 791 KB

A taxonomy of binary tree traversals

✍ Alfs Berztiss 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 505 KB

Inorder traversal of splay trees

✍ Colm Ó Dúnlaing 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the trees reasonably well balanced through a 'splay heuristic.' Sleator and Tarjan showed that if amortised rather than worst-cas

Constructing a binary tree from its trav

Constructing a binary tree from its traversals

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

On a recursive inverse eigenvalue proble

On a recursive inverse eigenvalue problem

✍ Kh. D. Ikramov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 125 KB