# What it takes to learn something

27 Jul 2016 | life algorithm runningWhen you see the fundamentals more clearly, you can build better solutions on your own…

Web Developer and Programmer

When you see the fundamentals more clearly, you can build better solutions on your own…

In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum.

The subject of binary trees provides a lot of variation, mainly in the number of ways in which they can be classified. This, in turn, provides an array of inductive proofs that can be applied differently dependending on your input data. This post is intended to cover some of the variations of binary trees and neat proofs relating to their number of nodes ($N$), number of internal nodes ($I$), number of leaves ($L$), and height ($H$).