Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Here’s the binary tree in question. The leaves are a, b, c, d and the edges are labelled 0 or 1.
.
/ \
a .
/ \
b .
/ \
c d
It seems to me that it is a full binary tree, as every node is either a leaf or has two child nodes, however I have this feeling that we were told it is not a full binary tree. If not, why is it not?
If a node has a child that is a leaf, does that not count as a child node?
You are confusing a perfect binary tree with a full binary tree. A perfect binary tree is a full binary tree with all leaf nodes at the same level. So yes, the picture is a full binary tree.
A leaf is defined as a node without a child node.
Thus, a full binary tree is a binary tree in which each node has either zero or two children.
Wikipedia helps very well with definitions. Make sure you check it out.