ニュース

搜狐6年

Baozi Training Leetcode solution 173:Binary Search Tree Iterator

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next will return the next smallest number in the BST. next and hasNext ...