6533b85efe1ef96bd12bf339
RESEARCH PRODUCT
Generation of Valid Labeled Binary Trees
Brice Effantinsubject
Discrete mathematicsBinary treeOptimal binary search tree[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Weight-balanced tree[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Scapegoat treeComputer Science::Computational GeometryRandom binary treeCombinatoricsBinary search treeTernary search treeMetric treeMathematicsComputingMethodologies_COMPUTERGRAPHICSdescription
International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-01-01 |