Multiple Choice
The worst case time complexity of AVL tree is better in comparison to binary search tree for
A) search and insert operations
B) search and delete operations
C) insert and delete operations
D) search, insert and delete operations
Correct Answer:
Verified
Correct Answer:
Verified
Q7: To represent hierarchical relationship between elements, which
Q8: The Default Parameter Passing Mechanism is called
Q9: Which of the following data structure is
Q10: The smallest individual units of c program<br>A)the
Q11: C is _ Language?<br>A)low level<br>B)high level<br>C)assembly level<br>D)machine
Q12: Queue is a _ list.<br>A)lifo<br>B)lilo<br>C)filo<br>D)fifo
Q13: The _ memory allocation function modifies the
Q14: What is Dequeue?<br>A)elements can be added from
Q15: Number of binary trees formed with 5
Q17: In which linked list last node address