Added solution for LeetCode 110 - Balanced Binary Tree (C++)#529
Open
yaswanthkurri wants to merge 1 commit intocodedecks-in:masterfrom
Open
Added solution for LeetCode 110 - Balanced Binary Tree (C++)#529yaswanthkurri wants to merge 1 commit intocodedecks-in:masterfrom
yaswanthkurri wants to merge 1 commit intocodedecks-in:masterfrom
Conversation
Author
|
Hi @maintainers, Could you please take a look at this PR when you have a moment? Your review is needed to approve and merge it. Thanks in advance! 🙏 |
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
1 participant
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.
…Problem: Balanced Binary Tree
Check if a binary tree is height-balanced, meaning the heights of left and right subtrees of every node differ by at most 1.
Approach:
Bottom-up recursion to compute subtree heights.
Return -1 if any subtree is unbalanced.
Tree is balanced if final result is not -1.
Complexity:
Time: O(n)
Space: O(h) (recursion stack)
Tested on:
Empty tree, single node tree, balanced trees, and unbalanced trees.