We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
add following tree algorithms: 1)Tree Traversal Algorithms
In-order Traversal Pre-order Traversal Post-order Traversal Level-order Traversal Maximum Depth of a Binary Tree
2)Check if a Tree is Balanced
3)Lowest Common Ancestor (LCA) in Binary Tree
4)Check if a Binary Tree is a Binary Search Tree (BST)
5)Tree Diameter (Longest Path in a Binary Tree)
6)Invert Binary Tree (Mirror Image)
7)Serialize and Deserialize Binary Tree
8)Construct a Binary Tree from In-order and Pre-order Traversals
Sanika Bhalerao
contributor
The text was updated successfully, but these errors were encountered:
🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.
Feel free to join our community on Discord to discuss more!
Sorry, something went wrong.
@SanikaBhalerao1345 raise PR for this I will add labels in that PR directly.
No branches or pull requests
Is there an existing issue for this?
Feature Description
add following tree algorithms:
1)Tree Traversal Algorithms
In-order Traversal
Pre-order Traversal
Post-order Traversal
Level-order Traversal
Maximum Depth of a Binary Tree
2)Check if a Tree is Balanced
3)Lowest Common Ancestor (LCA) in Binary Tree
4)Check if a Binary Tree is a Binary Search Tree (BST)
5)Tree Diameter (Longest Path in a Binary Tree)
6)Invert Binary Tree (Mirror Image)
7)Serialize and Deserialize Binary Tree
8)Construct a Binary Tree from In-order and Pre-order Traversals
Record
Full Name
Sanika Bhalerao
Participant Role
contributor
The text was updated successfully, but these errors were encountered: