5 years ago in UGC CS - December 2012

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
Loading...
Next Question

Overall Stats

Attempted 16
Correct 7
Incorrect 6
Viewed 3

Answers

Guest
Guest
Srusti Lingaraju
Srusti Lingaraju - 1 month ago

Srusti Lingaraju is saying Search, Insert and Delete Operations is correct answer

Tasheel
Tasheel - 3 months ago

Tasheel is saying Insert and Delete Operations is correct answer

Keerthana BN
Keerthana BN - 5 months ago

Keerthana BN is saying Search and Insert Operations is correct answer

Raghuveer Dhakad
Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying Search, Insert and Delete Operations is correct answer

suresh 1547
suresh 1547 - 2 years ago

suresh 1547 from India is saying Search and Insert Operations is correct answer

Related Questions

In which tree, for every node the height of its left subtree and right subtree differ almost by one ?

  • [A] Binary search tree
  • [B] AVL tree
  • [C] Threaded Binary Tree
  • [D] Complete Binary Tree

In complete design, 'reducing the strength' refers to

  • [A] Reducing the range of values of input variables
  • [B] Code Optimization using cheaper machine instructions
  • [C] Reducing efficiency of program
  • [D] of program (D)