Answer Posted / himani madan
A binary tree is a tree in which each node has either 0 or 2
child nodes.
| Is This Answer Correct ? | 5 Yes | 4 No |
Post New Answer View All Answers
Differentiate between queue and deque.
Write a program to reverse a link list.
What is the time complexity of hashmap get () and put () method?
Can hashmap be sorted?
Which is the parent class of hashmap class?
Explain binary searching, Fibonacci search.
Does concat mutate array?
Write code for reversing a linked list.
Explain the difference between hashset and hashmap?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What is the use of prototype?
What is array sort?
What’s the difference between enumeration and iterator interfaces?
What is the use of isEmpty() member methods?
What is the best case for bubble sort?
