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
There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?
Is arraylist a list?
What do you mean by 2-3 tree?
Explain recursive function & what is the data structures used to perform recursion?
What is different between array and list?
What is the minimum number of queues that can be used to implement a priority queue?
List out the applications of a linked list?
What is the difference between a Stack and a Queue.
Can you declare an array without assigning the size of an array?
What's the difference between a hashtable and a hashmap?
Can we insert null in set?
Can you sort a hashmap?
Why is map not a collection?
Is array faster than arraylist?
What is a simple path?
