Home/ Questions/Q 220981
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-11T18:59:26+00:00

Here’s the binary tree in question. The leaves are a, b, c, d and

  • 0

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?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    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.

    • 0