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 depth of the two subtrees of every node never differs by more than one.
Discussion (0)
Share your thoughts and ask questions
Join the Discussion
Sign in with Google to share your thoughts and ask questions
No comments yet
Be the first to share your thoughts and start the discussion!
