6 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

Create your Digital Resume For FREE on your name's sub domain "yourname.wcard.io". Register Here!


Overall Stats

Attempted 16
Correct 7
Incorrect 6
Viewed 3

Answers

Guest
Guest
Srusti Lingaraju
Srusti Lingaraju - 1 year ago

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

Tasheel
Tasheel - 1 year ago

Tasheel is saying Insert and Delete Operations is correct answer

Keerthana BN
Keerthana BN - 1 year ago

Keerthana BN is saying Search and Insert Operations is correct answer

Raghuveer Dhakad
Raghuveer Dhakad - 3 years ago

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

suresh 1547
suresh 1547 - 3 years ago

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

Related Questions

The power set of the set {Φ} is

  • [A] {Φ}
  • [B] {Φ, {Φ}}
  • [C] {0}
  • [D] {0, Φ, {Φ}}

The 'C' language is

  • [A] Context free language
  • [B] Context sensitive language
  • [C] Regular language
  • [D] None of the above

Which of the following mode declaration is used in C++ to open a file for input ?

  • [A] ios : : app
  • [B] in : : ios
  • [C] ios : : file
  • [D] ios : : in