Lab 11

Write a JavaScript program that models binary trees of numbers using nodes with left, right, and n nodes, and null at the leaves. Develop the addAll function that accepts a tree and returns the sum.

More interesting, but optional: write a functional insert method that takes a BST and a number to insert and returns a new BST including the new number.