Opened 7 years ago

Last modified 6 years ago

#14498 closed enhancement

trees and binary trees — at Initial Version

Reported by: elixyre Owned by: sage-combinat
Priority: major Milestone: sage-6.2
Component: combinatorics Keywords: trees, binary trees, latex
Cc: florent.hivert@…, viviane.pons@…, chapoton, ncohen Merged in:
Authors: Jean-Baptiste Priez Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Description

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

Change History (3)

Note: See TracTickets for help on using tickets.