Binary trees and number of states in buddy systems
Zolt\'an K\'asa, Leoan T\^ambulea
TL;DR
This paper calculates the number of binary trees with specific properties and uses these results to determine the number of states in the buddy memory allocation system.
Contribution
It introduces a method to compute the number of binary trees and applies it to analyze the state space of buddy systems, providing new combinatorial insights.
Findings
Number of binary trees with n nodes and k leaves
Number of leaves in all binary trees with n nodes
Number of states in the buddy system
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals