binary tree inorder traversal

binaryTreeInorderTraversal.js

// https://leetcode.com/problems/binary-tree-inorder-traversal/

const dft = (root, result) => {
  if (!root) return;
  dft(root.left, result);
  result.push(root.val);
  dft(root.right, result);
  return result;
};

const inorderTraversal = (root) => {
  const result = [];
  dft(root, result); // recursive call made to other function
  return result;
};