✦ LIBER ✦

On deletion in threaded binary trees

✍ Scribed by Keith Brinck

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 832 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90030-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On binary search trees

✍ Roberto De Prisco; Alfredo De Santis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 378 KB

On growing random binary trees

✍ Boris Pittel 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 841 KB

On rotations in fringe-balanced binary t

On rotations in fringe-balanced binary trees

✍ Hosam M. Mahmoud 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We employ a P6lya urn to model rotations in a random fringe-balanced binary search tree. We show that asymptotically the number of rotations to construct a tree of size n has a normal distribution with mean +n and variance sn. Exact results for mean and variance are developed in the process. @ 1998

On Embedding Binary Trees into Hypercube

On Embedding Binary Trees into Hypercubes

✍ W.K. Chen; M.F.M. Stallmann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Computation on binary tree-networks

✍ Maurice Tchuente 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Simulation of Binary Trees and X-Trees o

Simulation of Binary Trees and X-Trees on Pyramid Networks

✍ A. Dingle; I.H. Sudborough 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 425 KB