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
For searches. Which one is most preferred: array list or linked list?
What is sorted list in data structure?
Which is better than array and linked list?
What is stable sorting?
Does concat mutate array?
What is two-dimensional array?
what is the difference between dynamic as well as non - dynamic data structures.
What is the space complexity of quicksort?
What are the types of data structures?
Mention some drawbacks of the linked list.
When should structures be passed by values or by reference?
What is data structure and why it is important?
How to use appendNode() in linkedlist()?
Explain binary tree traversals?
Can we add duplicate keys in a hashmap?
