Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
Why sorting is used?
What is binary tree used for?
What is the complexity of arraylist?
What is a pseudocode example?
What you mean by sorting?
How do you empty an arraylist?
What are the advantages and disadvantages of linked list over array?
What will be the output of below code?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
How many links are there in a binary tree of N nodes?
What is the difference between hashset and treeset?
What is the most used data structure?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Explain the Queue
What are the disadvantages array implementations of linked list?
