✦ LIBER ✦

A note on the stack size of regularly distributed binary trees

✍ Scribed by R. Kemp

Publisher: Springer Netherlands
Year: 1980
Tongue: English
Weight: 250 KB
Volume: 20
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933188

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note on the size of a multicast tree i

A note on the size of a multicast tree in hypercubes

✍ Satoshi Fujita 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 332 KB

A note on subtrees rooted along the prim

A note on subtrees rooted along the primary path of a binary tree

✍ Brent M. Troutman; Michael R. Karlinger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 348 KB

A note on optimal area algorithms for up

A note on optimal area algorithms for upward drawings of binary trees

✍ P. Crescenzi; G. Di Battista; A. Piperno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 793 KB

Distributions on bicoloured binary trees

Distributions on bicoloured binary trees arising from the principle of parsimony

✍ M.A. Steel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 926 KB

On the joint distribution of the nodes i

On the joint distribution of the nodes in uniform multidimensional binary trees

✍ Rainer Kemp 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 2 views

Multidimensional binary trees represent a symbiosis of trees and tries, and they essentially arise in the construction of search trees for multidimensional keys. The set of nodes in a d-dimensional binary tree can be partitioned into layers according to the nodes appearing in the ith dimension. We d