traverse a binary tree in javascript

index.tsx
function preOrderTraversal(node) {
  if (node !== null) {
    console.log(node.val); // visit the node
    preOrderTraversal(node.left); // traverse left subtree
    preOrderTraversal(node.right); // traverse right subtree
  }
}
229 chars
8 lines

index.tsx
function breadthFirstTraversal(root) {
  if (root === null) {
    return;
  }
  
  const queue = [root];
  
  while (queue.length > 0) {
    const node = queue.shift();
    console.log(node.val); // visit the node
    
    if (node.left !== null) {
      queue.push(node.left); // enqueue left child
    }
    
    if (node.right !== null) {
      queue.push(node.right); // enqueue right child
    }
  }
}
407 chars
21 lines