#19457: Generator for full binary trees
-------------------------------------------------+-------------------------
Reporter: patxiku | Owner: patxiku
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.10
Component: combinatorics | Resolution:
Keywords: binary trees, full | Merged in:
Authors: Adrien Boussicault, Bérénice | Reviewers:
Delcroix-Oger, Patxi Laborde-Zubieta | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Description changed by patxiku:
Old description:
> We add a generator for full binary trees.
New description:
We add a generator for full binary trees, and two methods :
- to_full() :
Return the full binary tree `bt` obtained from ``self`` by
replacing
each leaf of ``self`` by nodes with two child leaves.
- remove_nodes_with_two_child_leaves()
Return the binary tree obtained by removing the nodes of ``self``
with two child leaves.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19457#comment:2>
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/d/optout.
