Add Functionality to Find Inorder Successor and Predecessor in Binary Search Tree (BST) #1545 #1572
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 #1545
Description: This pull request adds two key functions to the project for navigating a Binary Search Tree (BST) efficiently:
Changes Made
BST Node Structure:
Defined a Node structure with data, left, and right pointers to represent each node in the BST.
Insert Function:
Added an insert function to build and populate the BST, preserving the properties of a binary search tree.
Inorder Predecessor and Successor Functions:
Example Usage in Main Function:
Demonstrates the usage of findPredecessor and findSuccessor functions on an example BST.
Example Output
For a BST constructed with the following sequence: 20, 8, 22, 4, 12, 10, 14:
Testing Inorder Predecessor and Successor for the node with value 12 yields
Inorder Predecessor of 12 is 10
Inorder Successor of 12 is 14
Usage and Benefits