Depth-First Traversal
Def
Depth-First Traversal is a graph traversal algorithm to visit all vertices or edges in a Graph or Tree. Doing a DFS means going as deep as we can first.
function inorderTraversal(node) {
if (node === null) return;
inorderTraversal(node.left);
console.log(node.val);
inorderTraversal(node.right);
}