+1 vote
in Data Structures & Algorithms I by (110k points)
What is a full binary tree?

(a) Each node has exactly zero or two children

(b) Each node has exactly two children

(c) All the leaves are at the same level

(d) Each node has exactly one or two children

My question is taken from Binary Tree Properties in portion Binary Trees of Data Structures & Algorithms I

The question was asked during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct choice is (a) Each node has exactly zero or two children

Easy explanation - A full binary tree is a tree in which each node has exactly 0 or 2 children.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.