-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #729 from fartem/173_binary_search_tree_iterator
2024-09-04 v. 6.6.2: added "173. Binary Search Tree Iterator"
- Loading branch information
Showing
4 changed files
with
72 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,35 @@ | ||
# frozen_string_literal: true | ||
|
||
# https://leetcode.com/problems/binary-search-tree-iterator/ | ||
class BSTIterator | ||
# @param {TreeNode} root | ||
def initialize(root) | ||
@values = [] | ||
@pointer = 0 | ||
|
||
traverse173(root) if root | ||
end | ||
|
||
# @return {Integer} | ||
def next | ||
value = @values[@pointer] | ||
@pointer += 1 | ||
|
||
value | ||
end | ||
|
||
# @return {Boolean} | ||
def has_next = @values.size > @pointer | ||
|
||
private | ||
|
||
# @param {TreeNode} node | ||
# @return {Void} | ||
def traverse173(node) | ||
return unless node | ||
|
||
traverse173(node.left) | ||
@values << node.val | ||
traverse173(node.right) | ||
end | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,35 @@ | ||
# frozen_string_literal: true | ||
|
||
require_relative '../test_helper' | ||
require_relative '../../lib/common/binary_tree' | ||
require_relative '../../lib/medium/173_binary_search_tree_iterator' | ||
require 'minitest/autorun' | ||
|
||
class BinarySearchTreeIndicatorTest < ::Minitest::Test | ||
def test_default_one | ||
bst_iterator = ::BSTIterator.new( | ||
::TreeNode.new( | ||
7, | ||
::TreeNode.new(3), | ||
::TreeNode.new( | ||
15, | ||
::TreeNode.new(9), | ||
::TreeNode.new(20) | ||
) | ||
) | ||
) | ||
|
||
assert_equal(3, bst_iterator.next) | ||
assert_equal(7, bst_iterator.next) | ||
assert(bst_iterator.has_next) | ||
|
||
assert_equal(9, bst_iterator.next) | ||
assert(bst_iterator.has_next) | ||
|
||
assert_equal(15, bst_iterator.next) | ||
assert(bst_iterator.has_next) | ||
|
||
assert_equal(20, bst_iterator.next) | ||
assert(!bst_iterator.has_next) | ||
end | ||
end |