Answer Posted / babita
A tree with at most two children for each node.
| Is This Answer Correct ? | 13 Yes | 1 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
Who invented data structure?
Define degree of the node?
How is a hashset implemented?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
What are the difference between a stack and a queue?
Sorting is not possible by using which of the methods?
Explain circular linked list?
Why is hashmap faster than arraylist?
Define a binary search tree?
Why quicksort is faster?
How will you sort the elements of array in descending order?
Is quicksort a stable sorting algorithm?
For which header list, the last node contains the null pointer?
Is array a linked list?
Can hashmap be sorted?
