Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightBinary search tree has best case run time complexity of ?(log n). What...

Binary search tree has best case run-time complexity of ?(log n). What...

  • Q. Binary search tree has best case run-time complexity of ?(log n). What could the worst case?
  • filter_dramaExplanation
    Answer is : A
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. What is the disadvantage of using splay trees?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. Re-balancing of AVL tree costs
  • filter_dramaExplanation
    Answer is : B
    None.
  • 3. All possible spanning trees of graph G
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points