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
In what areas do data structures applied?
What are the advantages and disadvantages of copyonwritearraylist?
What's the difference between an array and vector?
What is sorting and classifying?
What is unmodifiable list?
What are linked lists most commonly used for?
What is the idea behind splaying?
Does linkedhashset allow null values?
Is arraylist a class?
What is stable sort example?
Define heap order property?
Explain the priority queue?
Explain implementation of traversal of a binary tree.
Explain multiply linked list in short.
Can hashmap be sorted?
