leetcode/problems/binary-search-tree-iterator-ii at master · open-one/leetcode

Name	Name	Last commit message	Last commit date
parent directory ..
README.md	README.md

Name

Last commit message

Last commit date

< Previous 　　　　　　　　　　　　　　　　 Next >

1586. Binary Search Tree Iterator II (Medium)

Hint 1

The inorder traversal of a BST gives us the elements in a sorted order.

Hint 2

We can use a stack to simulate the inorder traversal of the BST.

Hint 3

We can use another stack as a buffer to store numbers returned from calls to next and use this buffer whenever prev is called.