edited by
2,833 views
4 votes
4 votes

What is the difference between

Binary Tree and Almost complete Binary tree and complete Binary Tree and full Binary Tree and Binary search Tree and Balanaced Binary Search Tree. 

Diagram would be appriciated otherwaise write 2-3 basic difference .

edited by

3 Answers

0 votes
0 votes

Binary tree :- Any tree with max two child nodes

Full Binary tree:- Any tree with a given level h having 2^h-1 elements

complete binary tree : if we start removing elements from full binary tree ( 0 or more from rightmost leaf node )result will always be a CBT 

almost CBT : it is a complete binary tree in which  last level is not full (i.e at least one element has to be removed from full binary tree)

BST  is based on values values in left are less than root and values at right are more than root

e.g  

         30

12              45

for balanced BST refer

https://www.cpp.edu/~ftang/courses/CS241/notes/self%20balance%20bst.htm

edited by
0 votes
0 votes
courses.cs.vt.edu/~cs3114/Fall09/wmcquain/Notes/T03a.BinaryTreeTheorems.pdf

i think u should give it a try.
0 votes
0 votes

In above are the types of binary tree

edited by

Related questions

1 votes
1 votes
1 answer
3
iarnav asked Jan 7, 2018
1,455 views
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.
0 votes
0 votes
1 answer
4