4,286 views
1 votes
1 votes
what is the difference between all these types of trees

1)full binary tree 2) complete binary tree 3) almost complete binary tree 4)perfect binary tree 5)strictly binary tree

is every full binary tree is of all types of binary trees

2 Answers

0 votes
0 votes

(1) Full/Perfect binary tree: All leaves are same level and all non-leaf nodes have two child nodes.

(2) Complete binary tree: All leaves are at same level.

(3) Strictly binary tree: Every non leaf nodes must have two child nodes.

0 votes
0 votes

I find the following link helpful

Difference between “Complete binary tree”, “strict binary tree”,“full binary Tree”-  https://stackoverflow.com/questions/12359660/difference-between-complete-binary-tree-strict-binary-tree-full-binary-tre/32064101#32064101

Difference between complete and almost complete binary tree- https://stackoverflow.com/questions/26327125/difference-between-complete-and-almost-complete-binary-tree

Related questions

0 votes
0 votes
1 answer
2
Sanjay Sharma asked May 17, 2016
4,067 views
a)complete binary tree 1. min no. of nodes= 2.max no.of modes=3. leaf node=4. non-leaf node=b)full binary tree 1. min no. of nodes=2.max no.of modes=3. leaf node=4. non-l...
0 votes
0 votes
1 answer
3
sripo asked Nov 8, 2018
631 views
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between...
4 votes
4 votes
1 answer
4
Shashank Chavan asked Jan 18, 2016
11,130 views
What's the difference between Binary tree height, level and depth? Sometimes it's confusing!Does there definition change according to question also, if mentioned?