Binary trees and number of states in buddy systems
Abstract
In the paper are computed: the number of binary trees with n nodes and k leaves; the number of leaves in the set of all binary trees with n nodes. These are used to compute the number of states in the buddy system.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.