MediumUnderstandTrees & BSTMultiple 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

AO(n) per call
BO(log n) amortized per call
CO(1) per call
DO(h) per call

Want to see the correct answer?

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

See the Answer on Guru Sishya →

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

Learn Trees & BST→Browse All Questions

More Trees & BST Questions

What does inorder traversal of a BST produce?

Easy

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

Easy

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

Easy

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

Medium-Easy

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

Medium-Easy