Binary trees and number of states in buddy systems
Zoltán KásaLeoan Tâmbulea
所有作者
Zoltán KásaLeoan Tâmbulea
文献摘要
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.