Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as:
a binary tree in which the left and right subtrees of every node differ in height by no more than 1.
Visual Studio
C++
-
Notifications
You must be signed in to change notification settings - Fork 0
Nicholai518/balanced-binary-tree-cpp-leetcode
About
Problem number 110 Balanced Binary Tree on Leetcode.com
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published