Answer Posted / tadveer verma
a tree which has atmost two child is called a binary tree.
| Is This Answer Correct ? | 3 Yes | 3 No |
Post New Answer View All Answers
Explain the term tail recursion?
What is pointer in data structure?
Are linked lists considered linear or non-linear data structures?
How would you reverse the characters of an array?
Why hashmap is faster than hashtable?
Which interface treemap implements?
Can map contain duplicate keys?
What is sort order?
What are the applications of graph data structure?
What is time and space complexity of bubble sort?
What is two-dimensional array?
What do you understand by doubly linked list?
What is sequential sorting?
Mention the advantages of representing stacks using linked lists than arrays?
Explain the priority queue?