Abstract
We investigate properties of binary (search) trees related to the “inorder” labelling of the nodes. Both permutation and uniform trees are considered. We give explicit formulas to count the number of interior, middle and final nodes (leaves) containing a specific label. Possible applications are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have