#14564: BinaryTree().graph() falsely claims that the graph has 0 vertices
---------------------------------------+--------------------------
Reporter: darij | Owner: tbd
Type: defect | Status: needs_info
Priority: minor | Milestone: sage-5.13
Component: combinatorics | Resolution:
Keywords: binary trees, trees | Merged in:
Authors: darij | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------------+--------------------------
Comment (by darij):
I completely agree with you on the symbolic ring. But I don't understand
the "every node which is not a leaf has two children" thing: isn't that
true for ANY binary tree in the sense of binary_tree.py? If not, I will
have to fix this too:
{{{
53 Binary trees contain nodes and leaves, where each node
has two
54 children while each leaf has no children. The number
of leaves
55 always equals the number of nodes plus 1.
}}}
Either way, what is a full binary tree then?
--
Ticket URL: <http://trac.sagemath.org/ticket/14564#comment:21>
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.
