adding binary tree code and theory #24
Merged
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
![github-actions[bot]](https://avatars.githubusercontent.com/in/15368?s=60&v=4){kind=small}
|
can you add the hacktoberfest-accepted label to this pr for succesfully accepted to the hacktoberfest. |
abhishektripathi66
approved these changes
Oct 22, 2024
|
issue no: #22 is solved |
abhishektripathi66
merged commit c378783
into
abhishektripathi66:master
2 checks passed
|
@abhishektripathi66 this repository is not participating in the hacktoberfest so can you add the topic to your repository as hactoberfest or just add the label hactoberfest-accepted in this pr. |
|
@surendra-sk |
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.
Documentation Summary:
Node Class:
Represents each node in the tree.
Each node contains an integer key and two references (left and right).
BinaryTree Class:
The main class that manages the binary tree.
Contains methods for:
Insertion: Adds nodes to the tree.
Traversal: Supports in-order, pre-order, and post-order traversals.
Search: Finds if a value exists in the tree.
Time Complexity:
Insertion: O(log n) in the average case (if the tree is balanced).
Traversal: O(n), where n is the number of nodes.
Search: O(log n) in the average case (if the tree is balanced).
OUTPUT OF THE CODE :
In-order traversal:
20 30 40 50 60 70 80
Pre-order traversal:
50 30 20 40 70 60 80
Post-order traversal:
20 40 30 60 80 70 50
Search for 60: true
Search for 90: false