#14498: trees and binary trees
-------------------------------------+-------------------------------------
Reporter: elixyre | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.13
Component: combinatorics | Resolution:
Keywords: trees, binary | Merged in:
trees, latex | Reviewers: Darij Grinberg,
Authors: Jean-Baptiste | Frederic Chapoton
Priez | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: #8703, #14784 |
-------------------------------------+-------------------------------------
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]
> * [attachment:trac_14498-tree-imps-dg-rebased.patch]
> * [attachment:trac_14998-more-edits-dg.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-rebased.patch]
* [attachment:trac_14998-more-edits-dg.patch]
* [attachment:trac_14498-further-docfixes-dg.patch]
--
Comment (by darij):
Sorry guys. Had to introduce further docfixes after noticing that several
methods fail to preserves labels on leaves of binary trees. The whole
issue of leaves not being fully-accepted vertices of binary trees is
extremely confusing...
for the '''patchbot''':
apply trac_14498-algorithms_trees-rebased.patch trac_14498-tree-imps-dg-
rebased.patch trac_14998-more-edits-dg.patch trac_14498-further-docfixes-
dg.patch
--
Ticket URL: <http://trac.sagemath.org/ticket/14498#comment:45>
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.
