The Gateway to Computer Science Excellence
0 votes
53 views
The major difference betwen

Full binary tree, Complete binary tree, and strict binary tree
in Programming by (381 points)
reshown by | 53 views
+1
A full binary tree in which all internal node will have 2 children all leaf nodes(last level) will have 0 childrens.

A complete binary tree is in which tree is filled as much as left as possible. Like in heap we make complete binary tree.(First all left side nodes are filled than we fill the right sub-tree).

A strict binary tree will be if every non-leaf node is filled with a node. No non;leaf node will be empty.
0
Hi, please try to use Google before posting any trivial questions.
0

Hi, @Sasta_yoda 

See, What corman says

And now see what narasimha karumanchi says

And when i googled it then i found karumachi's defination correct. But corman is suggested by many topper that's why i thought it's better to ask someone.

 

0
Lemme settle this once and for all. Whenever you see such ambiguity there is a very high chance that the standard book is correct. Karumachi is a local author, moreover please know in Gate they always mention the definition if they feel it might have ambiguity.
0
Ok, thanks.

Related questions

0 votes
1 answer
3
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,265 comments
104,978 users