Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


what is atmost complete binary tree?

Answers were Sorted based on User's Feedback



what is atmost complete binary tree?..

Answer / iti

An almost complete binary tree is a tree in which each node
that has a right child also has a left child. Having a left
child does not require a node to have a right child. Stated
alternately, an almost complete binary tree is a tree where
for a right child, there is always a left child, but for a
left child there may not be a right child.
The number of nodes in a binary tree can be found using this
formula: n = 2^h Where n is the amount of nodes in the tree,
and h is the height of the tree.

Is This Answer Correct ?    61 Yes 9 No

what is atmost complete binary tree?..

Answer / lomesh ahire

complete binary tree is tree in which all the nodes except
leaf nodes has two childes and all the leaf nodes are at
the same height.atmost complete binary tree is tree in
which all nodes has atmost two childs.

Is This Answer Correct ?    28 Yes 17 No

what is atmost complete binary tree?..

Answer / aniket

I wold like to make 1 small change in answer1.

No. of nodes varies from 2^(h-1)+1 to 2^(h) -1

Is This Answer Correct ?    8 Yes 4 No

what is atmost complete binary tree?..

Answer / jonu

if we are having an ordinal binary tree..
then No. Of nodes varies from 2^(h-1)-1 to 2^(h)-1

for example if h=3
then No. of node varies from 2^(3-1)-1 = 3 to 2^3-1 = 7

but for complete binary tree

No. Of node will be 2^h-1 only....

don't mind but Iti and Aniket your ans. is not actually correct...

Is This Answer Correct ?    2 Yes 0 No

what is atmost complete binary tree?..

Answer / shikha

all the leaf should be in last or second last level.no other level is allowed

Is This Answer Correct ?    0 Yes 0 No

what is atmost complete binary tree?..

Answer / parveen

a tree is sed to be a cbt if each node except leaf node has
two childrens

Is This Answer Correct ?    3 Yes 8 No

Post New Answer

More Data Structures Interview Questions

Do you know what is linear search?

0 Answers  


Can a binary tree be empty?

0 Answers  


What is sort order?

0 Answers  


What is a tech stack?

0 Answers  


What is a data structure node class?

0 Answers  


What is difference between array and string?

0 Answers  


What is a sorting algorithm in data structure?

0 Answers  


How does selection sort work?

0 Answers  


Write an algorithm to show various operations on ordered list and arrays

0 Answers  


What is int data type?

0 Answers  


What is hash value of a string?

0 Answers  


Is there any difference between int[] a and int a[]?

0 Answers  


Categories