98.validate binary search tree#27
Open
nicah4o wants to merge 3 commits into
Open
Conversation
Added explanation and code for validating a binary search tree, including step-by-step reasoning and examples.
nodchip
reviewed
Jun 5, 2026
| public: | ||
| bool search_left(TreeNode* node, int max) { | ||
| if (!node) | ||
| return true; |
There was a problem hiding this comment.
こちらのコメントをご参照ください。
Shunii85/arai60#17 (comment)
Owner
Author
There was a problem hiding this comment.
レビューありがとうございます。
見た目的にもぶら下がりifを選んでしまいがちですが注意します。。
| }; | ||
| ``` | ||
|
|
||
| 時間かけると解ける時があるので損切りに時間がかかってしまった。解けることが目的ではないが快楽が大きい。 |
There was a problem hiding this comment.
快楽が大きいという認識はとても重要だと思います。快楽を制御できるととても良いのだと思います。
| } | ||
|
|
||
| private: | ||
| bool valid(TreeNode* node, long min, long max) { |
There was a problem hiding this comment.
valid は形容詞です。形容詞は関数名にはあまり使わないように思います。 validate はいかがでしょうか？
こちらのコメントもご参照ください。
quinn-sasha/leetcode#29 (comment)
Owner
Author
There was a problem hiding this comment.
ありがとうございます。
解答を写すにしても変数名関数名に気を配るようにします。
Added explanations and code examples for validating a binary search tree using BFS, inorder traversal with a stack, and recursion. Included links to related pull requests.
Refactor isValidBST function for better readability and performance. Implemented inorder traversal and improved variable naming.
liquo-rice
reviewed
Jun 5, 2026
liquo-rice
reviewed
Jun 5, 2026
| class Solution { | ||
| public: | ||
| bool isValidBST(TreeNode* root) { | ||
| return valid(root, min, max); |
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This problem: https://leetcode.com/problems/validate-binary-search-tree/description/
Next problem: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/