Skip to content

Commit 8e65e0f

Browse files
authored
Merge pull request #693 from fartem/98_Validate_Binary_Search_Tree
2024-07-30 v. 6.3.4: added "98. Validate Binary Search Tree"
2 parents 6c7a957 + 1bb48ef commit 8e65e0f

File tree

4 files changed

+59
-1
lines changed

4 files changed

+59
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -499,3 +499,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
499499
| 92. Reverse Linked List II | [Link](https://leetcode.com/problems/reverse-linked-list-ii/) | [Link](./lib/medium/92_reverse_linked_list_ii.rb) |
500500
| 95. Unique Binary Search Trees II | [Link](https://leetcode.com/problems/unique-binary-search-trees-ii/) | [Link](./lib/medium/95_unique_binary_search_trees_ii.rb) |
501501
| 96. Unique Binary Search Trees | [Link](https://leetcode.com/problems/unique-binary-search-trees/) | [Link](./lib/medium/96_unique_binary_search_trees.rb) |
502+
| 98. Validate Binary Search Tree | [Link](https://leetcode.com/problems/validate-binary-search-tree/) | [Link](./lib/medium/98_validate_binary_search_tree.rb) |

leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ require 'English'
55
::Gem::Specification.new do |s|
66
s.required_ruby_version = '>= 3.0'
77
s.name = 'leetcode-ruby'
8-
s.version = '6.3.3'
8+
s.version = '6.3.4'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# frozen_string_literal: true
2+
3+
# https://leetcode.com/problems/validate-binary-search-tree/
4+
# @param {TreeNode} root
5+
# @return {Boolean}
6+
def is_valid_bst(root)
7+
is_bst(root, nil, nil)
8+
end
9+
10+
private
11+
12+
# @param {TreeNode} root
13+
# @param {TreeNode} left
14+
# @param {TreeNode} right
15+
# @return {Boolean}
16+
def is_bst(node, left, right)
17+
return true unless node
18+
19+
return false if !left.nil? && node.val <= left.val
20+
21+
return false if !right.nil? && node.val >= right.val
22+
23+
is_bst(node.left, left, node) && is_bst(node.right, node, right)
24+
end
Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/common/binary_tree'
5+
require_relative '../../lib/medium/98_validate_binary_search_tree'
6+
require 'minitest/autorun'
7+
8+
class ValidateBinarySearchTreeTest < ::Minitest::Test
9+
def test_default
10+
assert(
11+
is_valid_bst(
12+
::TreeNode.new(
13+
2,
14+
::TreeNode.new(1),
15+
::TreeNode.new(3)
16+
)
17+
)
18+
)
19+
assert(
20+
!is_valid_bst(
21+
::TreeNode.new(
22+
5,
23+
::TreeNode.new(1),
24+
::TreeNode.new(
25+
4,
26+
::TreeNode.new(3),
27+
::TreeNode.new(6)
28+
)
29+
)
30+
)
31+
)
32+
end
33+
end

0 commit comments

Comments
 (0)