Medium Understand Trees & BST Multiple Choice

What is the time complexity of BST Iterator (LC 173) nextSmallest() and hasNext() operations?

Understand — Tests comprehension and ability to explain concepts.

Answer Options

A O(n) per call

B O(log n) amortized per call

C O(1) per call

D O(h) per call

Get the answer with a detailed explanation, plus practice 33+ more Trees & BST questions with adaptive quizzes and timed interviews.

This question is from the Trees & BST topic (Data Structures).

What does inorder traversal of a BST produce?

What is the time complexity of search in a balanced BST?

What does the right side view of a binary tree (LC 199) return?

Why does comparing a node only to its direct parent fail when validating a BST?

In Lowest Common Ancestor of a Binary Tree (LC 236), when does the algorithm return the current root?