Function to Check if a Tree is a BST or Not issue#1236 #1365
Conversation
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
pankaj-bind
requested changes
Oct 29, 2024
|
i have updated it. |
|
You haven't made any changes. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Issue #1236
Description: This pull request adds a function in C to check if a binary tree satisfies the properties of a binary search tree (BST). The function isBST uses a helper isBSTUtil to recursively validate each node, ensuring all nodes in the left subtree are less and all nodes in the right subtree are greater than the current node.
Changes Made:
Implemented isBSTUtil to recursively check the BST properties.
Added isBST function to initialize and call the helper function.
Created a sample test in main to verify functionality.
Testing: The code has been tested with a sample binary tree structure, and it successfully identifies if the tree is a BST.