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
Define ancestor and descendant ?
What is structured data with example?
What are threaded binary trees?
What is static array?
What are the 3 types of measurement?
How dynamic arrays are created?
What does arraylist remove do?
What are the applications of linked list?
Is array a linked list?
What is structure of data type?
Is heap sort adaptive?
Write an algorithm to find middle element in the linked list.
What are the objectives of studying data structures?
What does isempty() member method determines?
Write a program for Sorting an Array. Which sorting will you prefer?
