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
Define biconnectivity?
Explain what is binary search?
Is duplicate allowed in hashmap?
Are collections thread safe?
Why is bubble sort stable?
Why is concurrenthashmap thread safe?
What is tree and its properties?
write a program to show the insertion and deletion of an element in an array using the position
What is priority queue in data structure?
Tell me the difference between the character array and a string.
Can we use ordered set for performing binary search?
Discuss how to implement queue using stack.
Why do we use different types of data structures?
What is a reverse linked list.
What are data members?
