The Gateway to Computer Science Excellence
+3 votes
2.5k views

Which of the following number of nodes can form a full binary tree?

  1. 8
  2. 15
  3. 14
  4. 13
in DS by Boss (30.8k points) | 2.5k views

1 Answer

+11 votes
Best answer

option B

by Veteran (57k points)
selected by
0
I think Full binary tree is where each node can have either 0 or 2 children. In that case both 13 and 15 will be correct. The image is showing complete Binary tree, which is more restrictive than Full binary tree. Am I right?
0
if each node having 0 or 2 childs then binary tree will be strictly binary tree.

if each node having 0 or 2 childs and all leaf nodes are at same level, then binary tree will be a full binary tree.
0
sir, what you are saying as full, I think it is Complete binary tree, if not then what is complete binary tree?
+1
Complete binary tree Vs Almost complete binary tree

Full binary tree Vs Complete Binary tree.

both are same referred differently in different books
+1
here full binary tree means complete binary tree not almost complete binary tree
0
Those terms are used interchangeably. Complete and full binary tree.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,297 answers
198,262 comments
104,976 users