text: /* DRUNKWATER TEMPLATE(add description and prototypes) */
  /* Question Title and Description on leetcode.com */
  /* Function Declaration and Function Prototypes on leetcode.com */
  //236. Lowest Common Ancestor of a Binary Tree
  //Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
  //According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”
  //        _______3______
  //       /              \
  //    ___5__          ___1__
  //   /      \        /      \
  //   6      _2       0       8
  //         /  \
  //         7   4
  //For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.
  ///**
  // * Definition for a binary tree node.
  // * function TreeNode(val) {
  // *     this.val = val;
  // *     this.left = this.right = null;
  // * }
  // */
  ///**
  // * @param {TreeNode} root
  // * @param {TreeNode} p
  // * @param {TreeNode} q
  // * @return {TreeNode}
  // */
  //var lowestCommonAncestor = function(root, p, q) {
  //};
  
  
  
  /* Time Is Money */