An O(n) algorithm to check if a binary tree is balanced, by passing up the height from recursive calls.
» jameshfisher.com | jameshfisher.com
An O(n) algorithm to check if a binary tree is balanced, by passing up the height from recursive calls.
» jameshfisher.com | jameshfisher.com