Binary Search Trees Quiz
5 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

What is the time complexity of the overall search in a Binary Search Tree (BST)?

  • $O(n)$
  • $O(1)$
  • $O(h)$ (correct)
  • $O( ext{log } n)$

    • In the context of the sorted map ADT, which methods use the search as a subroutine?

  • put and remove
  • get, put, and remove (correct)
  • get and put
  • get and remove

    • What is the maximum number of positions that TreeSearch is called on for a path in a BST?

  • $2^h$
  • $2h$
  • $h^2$
  • $h + 1$ (correct)

    • What does the TreeSearch algorithm return if the key is not found?

    <p>null (B)</p> Signup and view all the answers

    In the example of searching for key 4 in a BST, which positions are visited in the search?

    <p>2, 1, 6, 4 (B)</p> Signup and view all the answers

    More Like This

    Use Quizgecko on...
    Browser
    Open
    Browser
    Browser