Answer Posted / tadveer verma
a tree which has atmost two child is called a binary tree.
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
What is the complexity of sorting algorithm?
Is an arraylist a vector?
What do you understand by doubly linked list?
How do treesets work internally?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
Is hashmap get thread safe?
Is arraylist a list?
What are different types of linked lists?
Differentiate between file and structure storage structure.
How does a treemap work?
Why hashmap is faster than hashtable?
Why is concurrenthashmap thread safe?
What differences exist between hashmap and hashtable?
What is bubble sort used for?
Define terminal nodes in a tree?
