Answer Posted / yenealem
It is a data structure on that every node on the tree
contains at most two children in the tree.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the use of heap sort?
Describe the complexity of Binary search
What is difference between hashtable and hashmap?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
What is the difference between sorting and classifying?
Why null is not allowed in treemap?
Is char array null terminated?
What is a subtree in data structures?
What is dequeue in data structure?
Which is faster quick sort or merge sort?
What is the difference between arrays sort and collections sort?
State the difference between arrays and linked lists?
How does quick sort work?
What is worst case complexity algorithm?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
