✦ LIBER ✦

Vectorization of tree traversals

✍ Scribed by Lars Hernquist

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 791 KB
Volume: 87
Category: Article
ISSN: 0021-9991
DOI: 10.1016/0021-9991(90)90230-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for tree traversals

✍ N.C. Kalra; P.C.P. Bhatt 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 382 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

Morris' tree traversal algorithm reconsi

Morris' tree traversal algorithm reconsidered

✍ Prabhaker Mateti; Ravi Manghirmalani 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 813 KB

Efficient reconstruction of binary trees

Efficient reconstruction of binary trees from their traversals

✍ R.D. Cameron; B.K. Bhattacharya; E.A.T. Merks 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 334 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

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