Interested to Buy Any Domain ? << Click Here >> for more details...
what is atmost complete binary tree?
- 6 Answers
- 16194 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
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 |
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 |
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 |
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 |
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 |
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 |
What does enum do?
What is quick sort?
What are the non linear data structure?
What is binary tree and its properties?
What is a stable sorting algorithm?
What do you mean by 2-3-4 tree?
How do you do a mergesort?
What is the easiest sorting method to use in data structures?
What is the best complexity of bubble sort?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
What is stack algorithm?
Which is more efficient merge sort vs quicksort?
Windows 
