University of Sydney

COMP2123 (ND) Quiz 3

20

Questions

100%

Verification Rate

Question Preview

20 questions

Multiple ChoiceVerified

What is the big-O worst-case runtime to find a node in a BST where the height of the tree is h?

2 months agoView Solution →

Log in to view

Log in to view

View all 20 questions

Sign up for free to access the full question bank and detailed solutions