Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
 Ask Questions on ANYTHING, that arise in your Daily Life at     FORUM9.COM

 Categories  >>  Software  >>  Operating Systems  >>  Data Structures

 Windows Interview Questions Linux Interview Questions Unix Interview Questions Solaris Interview Questions RTOS Interview Questions Bulnex Interview Questions Operating Systems General Concepts Interview Questions Data Structures Interview Questions Operating Systems AllOther Interview Questions
Question
`what is atmost complete binary tree?`
Question Submitted By :: Angel.goyal3
I also faced this Question!!     Rank Answer Posted By

Re: what is atmost complete binary tree?
# 1
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 ? 59 Yes 8 No
Iti

Re: what is atmost complete binary tree?
# 2
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 15 No
Lomesh Ahire

Re: what is atmost complete binary tree?
# 3
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 3 No
Aniket

Re: what is atmost complete binary tree?
# 4
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
Parveen

Re: what is atmost complete binary tree?
# 5
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
Jonu

Re: what is atmost complete binary tree?
# 6
all the leaf should be in last or second last level.no other level is allowed
 Is This Answer Correct ? 0 Yes 0 No
Shikha