#14498: trees and binary trees
-----------------------------+----------------------------------------------
Reporter: elixyre | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.10
Component: combinatorics | Keywords: trees, binary trees, latex
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Jean-Baptiste Priez
Merged in: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------------------------
Hi,
I purpose 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 algorithms
* 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
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14498>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
