Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
Can we define the size of arraylist?
Is hashmap get thread safe?
What is heap tree?
What is array traversing?
List the data structures which are used in hierarchical data model.
What is the difference between the hash table and hash map?
Define outdegree of a graph?
Run time memory allocation is known as in data structure?
What is bubble insertion selection sort?
What is a priority queue?
What is stack in geography?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Write the advantage of separate chaining?
Why using cookie to store session info is a better idea than just using session info in the request?
What are the classification of data structures?
