Coding algorithm helper

Tree

function TreeNode(val, left, right) {
      this.val = (val===undefined ? 0 : val)
      this.left = (left===undefined ? null : left)
      this.right = (right===undefined ? null : right)
 }

Traversals. Depth-first: Inorder, pre-order, post-order. Bread-first.