Search code examples
javabinary-search-treenodestreenode

Can a tree node be both a root node and a leaf node?

Can a tree node be both a root node and leaf node? If so, why?

I understand that the root node is at Level 0 of the tree. I also understand that a leaf node is a tree node that has no children. So if a tree has a root node A and nothing else, would that root node A also be considered a leaf node?

Is it possible for a tree node to be both a root node and leaf node?

Solution

  • If a tree node can have both a root node and leaf node, why?

    You answered your own question:

    I understand that the root node is at Level 0 of the tree. I also understand that a leaf node is a tree node that has no children.

    Here's a diagram for better understanding: 

      root
   |
tree node
   |
leaf node

    So if a tree node had a root node of A and nothing else, would that be considered a leaf node also?

    Refer to your definition directly above. Diagram for better understanding:

    A - root node
    |
 tree node   <-- tree node & leaf node
    |
  (null)

    It is possible and how is it possible for a tree node to be both a root node and leaf node?

    If you consider the root node to be a tree node, then a root node with no children will be both a tree node and leaf node.