Node.js/JavaScript interview training - Binary Trees

I'm solving typical coding problems you would be asked to solve during an interview. These puzzles are a lot of fun and there's always something new to learn.

In this session, we look at trees. There are several traversal methods:
* Iterative, breadth-first search, level order traversal
* Recursive, depth-first search
* pre order
* in order
* post order

Problem
Given a binary tree in which each node element contains a number. Find the maximum possible sum from one leaf node to another.

[maguilecutty]

Tip: 'High' - 'rrr' - 'Arch' - 'i' - 'kal' :D Thanks for the AWESOME tute!

[ashking]

Thanks for the name of the extension :thumbsup