Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Python: Real-World Examples

DIY: Binary Search Tree Iterator

Explore how to create a binary search tree iterator class in Python with next() and has_next() methods. Understand how to traverse a BST to retrieve elements in ascending order and manage iteration state effectively.

We'll cover the following...

Problem statement

In this challenge, you have to implement a binary search tree iterator class called BSTIterator. The iterator will be initialized by the root node of the BST. You have to implement two methods:

  • next(): This will return the next smallest number in the BST.
...