Binary trees and number of states in buddy systems
Discrete Mathematics
2011-01-18 v1
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.
Cite
@article{arxiv.1101.2964,
title = {Binary trees and number of states in buddy systems},
author = {Zoltán Kása and Leoan Tâmbulea},
journal= {arXiv preprint arXiv:1101.2964},
year = {2011}
}