Combinatorial Rooted Ordered and Binary Trees

[hivert]

The patch defines several new classes for dealing with

• rooted recursive ordered trees (labelled and not)

• binary trees (labelled and not)

It also add the computation of the binary search tree and the decreasing or increasing tree for a permutation

It finally defines the bijection to Dyck words

Apply:

• attachment: trac_8703-trees-rebased.patch

Depends on #8702
Depends on #14433

Dependencies: #8702, merge with #14433

CC: @fchapoton @sagetrac-sage-combinat @VivianePons @darijgr

Component: combinatorics

Keywords: trees, Cernay2012

Author: Florent Hivert, Frédéric Chapoton

Reviewer: Florent Hivert, Frédéric Chapoton, Viviane Pons

Merged: sage-5.10.beta0

Issue created by migration from https://trac.sagemath.org/ticket/8703

[hivert]

comment:1

This is an experiment to see if user chapoton is receiving e-mail from trac...

[hivert]

comment:2

Updated a new patch after modification in #8702. Close to but not ready for review.

[hivert]

comment:3

Added Frédéric as an author to make sure not to forget him. He contributed several functions.

[hivert]

Changed author from Florent Hivert to Florent Hivert, Frédéric Chapoton

[hivert]

Changed keywords from none to trees

[hivert]

Dependencies: #8702

[hivert]

Description changed:

--- 
+++ 
@@ -1,3 +1,9 @@
-Patch in preparation in sage-combinat queue
+The patch defines several new classes for dealing with 
 
-Depends on #8702
+- rooted recursive ordered trees (labelled and not)
+
+- binary trees (labelled and not)
+
+It also add the computation of the binary search tree and the decreasing or increasing tree for a permutation
+
+It finally defines the bijection to Dyck words