/BalancedBinaryTree-Leetcode-110

:question: An algorithm that uses a DFS traversal to find out if any two heights of a binary tree differ by more than one. If not, the tree is balanced.

Primary LanguageJavaScript