#14498: trees and binary trees
----------------------------------------------+----------------------------
       Reporter:  elixyre                     |        Owner:  sage-
           Type:  enhancement                 |  combinat
       Priority:  major                       |       Status:  needs_review
      Component:  combinatorics               |    Milestone:  sage-5.13
       Keywords:  trees, binary trees, latex  |   Resolution:
        Authors:  Jean-Baptiste Priez         |    Merged in:
Report Upstream:  N/A                         |    Reviewers:
         Branch:                              |  Work issues:
   Dependencies:  #8703, #14784               |       Commit:
                                              |     Stopgaps:
----------------------------------------------+----------------------------
Description changed by darij:

Old description:

> Hi,
>
> I propose several methods for trees and binary trees:
>
> File : trees_classicals_algorithms_EliX-jbp:
> several classical operations on trees and binary trees
>  - on abstract trees:
>    * depth pre/post order transversal algorithm
>    * breadth first order transversal algorithm
>  - on binary trees:
>    * infix order transversal algorithm
>    * canonical permutation associated to the left/right binary search
> tree insertion
>    * left/right rotate (for labelled and unlabelled BT)
>
> File: trees_research_algorithms_EliX-jbp:
> several research algorithms on binary trees
>  - over/under (Loday-Ronco)
>  - pred/succ in the Tamari lattice
>  - hook length formula
>
> File: trees_latex_output_EliX-jbp:
> a method for nice latex output
>
> Apply:
>
> * [attachment:trac_14498-algorithms_trees-rebased.patch]

New description:

 Hi,

 I propose several methods for trees and binary trees:

 File : trees_classicals_algorithms_EliX-jbp:
 several classical operations on trees and binary trees
  - on abstract trees:
    * depth pre/post order transversal algorithm
    * breadth first order transversal algorithm
  - on binary trees:
    * infix order transversal algorithm
    * canonical permutation associated to the left/right binary search tree
 insertion
    * left/right rotate (for labelled and unlabelled BT)

 File: trees_research_algorithms_EliX-jbp:
 several research algorithms on binary trees
  - over/under (Loday-Ronco)
  - pred/succ in the Tamari lattice
  - hook length formula

 File: trees_latex_output_EliX-jbp:
 a method for nice latex output

 Apply:

 * [attachment:trac_14498-algorithms_trees-rebased.patch]
 * [attachment:trac_14498-tree-imps-dg.patch]

--

--
Ticket URL: <http://trac.sagemath.org/ticket/14498#comment:32>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.

Reply via email to