✦ LIBER ✦

Eliminating the flag in threaded binary search trees

✍ Scribed by Dan Gordon

Book ID: 113162962
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 383 KB
Volume: 23
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90137-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On deletion in threaded binary trees

✍ Keith Brinck 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 832 KB

Computing parent nodes in threaded binar

Computing parent nodes in threaded binary trees

✍ Keith Brinck 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 349 KB

Efficient algorithms to create and maint

Efficient algorithms to create and maintain balanced and threaded binary search trees

✍ S. Sitharama Iyengar; Hsi Chang 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 495 KB

Binary search trees in secondary memory

✍ William E. Wright 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 823 KB

Patterns in random binary search trees

✍ Philippe Flajolet; Xavier Gourdon; Conrado Martínez 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit

Maximal Flow in Branching Trees and Bina

Maximal Flow in Branching Trees and Binary Search Trees

✍ Federico Bassetti; Fabrizio Leisen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 341 KB