BST Iterator | LeetCode 173 смотреть онлайн

Design an iterator class that implements the following methods on a Binary Search Tree:

1. next(): Returns the next value in the #binary #search #tree in sorted order
2. hasNext(): Returns a boolean value whether or not the BST has next value.
Tips: The in-order traversal of a binary search tree iterates through the nodes in sorted order (ascending)

Can you do this without storing an array of the in-order traversal?

Yes. We are going to use a simulated recursion stack!

Happy coding!

TIMESTAMPS
--------------------------------------------------------------------------------------------------------
Intro: 00:00
So what exactly is a BST: 00:14
Illustration: 00:50
Complexity analysis: 09:03
Code: 10:26

QUESTION LINKS
---------------------------------------------------------------------------------------------------------
Difficulty: Medium
Source Code: https://github.com/MichaelVandi/CodingInterview/blob/master/Medium/03_04_2021_binary_search_tree_iterator.java
Problem Link: https://leetcode.com/problems/binary-search-tree-iterator/

FIND ME HERE
--------------------------------------------------------------------------------------------------------
Website: https://mvandi.com
Instagram: https://www.instagram.com/mike_ehl_/
Twitter: https://twitter.com/michael_vandi
Github: https://github.com/MichaelVandi/
Flyte (Side Project): https://flyte-app.com
Evalu8 (Side Project): https://evalu8.xyz