On the listing and random generation of hybrid binary trees

Abstract

We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.

Keywords:

• Binary trees
• ranking and unranking algorithms

C.R Categories:

• G.2.1. Combinatorial algorithms
• G.2. Trees (Graph Theory)