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
Explain the uses of matrix with an example?
When would you use a tuple?
What are the advantages of linked list?
What do you mean by primary clustering?
Is bubble sort adaptive?
State the difference between primitive and non-primitive data types?
Define a queue?
How many types of data structures are used?
Name few collections map implementations?
Is pointer a variable in data structure?
What are the advantages of array?
Write a program to reverse a link list.
What is a vector class?
Which data structure is used to perform recursion?
When ArrayIndexOutOfBoundsException occurs?
