How to check if a binary tree is balanced
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
A collection of awesome Algorithms books which should find a place in every programmer’s book self. Includes language specific books in Java, Python, and JavaScript for easy learning. Algorithms are language agnostic and any programmer worth their salt should be able to convert them to code in their programming language of choice. » Hacker Noon | hackernoon.com
Many junior developers dream of making it at one of the larger tech companies, but, to be honest with you, getting your first job is never easy. It is, in fact, one of the hardest things in your life and you need to put your best effort to find a job in your dream company. » Hacker Noon | hackernoon.com