Currently displaying 1 – 8 of 8

Showing per page

Order by Relevance | Title | Year of publication

On binary trees and Dyck paths

A. PanayotopoulosA. Sapounakis — 1995

Mathématiques et Sciences Humaines

A bijection between the set of binary trees with n vertices and the set of Dyck paths of length 2n is obtained. Two constructions are given which enable to pass from a Dyck path to a binary tree and from a binary tree to a Dyck path.

On binary trees and permutations

A. PanayotopoulosA. Sapounakis — 1992

Mathématiques et Sciences Humaines

Every binary tree is associated to a permutation with repetitions, which determines it uniquely. Two operations are introduced and used for the construction of the set of all binary trees. The set of all permutations which correspond to a given binary tree is determined and its cardinal number is evaluated.

Page 1

Download Results (CSV)