parse nary tree in javascript

index.tsx
function traverseTreeDFS(root, callback) {
  // base case: if root is null, return
  if (!root) return;
  
  // call the callback function on the current node
  callback(root);
  
  // if the node has children, recursively traverse them
  if (root.children && root.children.length > 0) {
    root.children.forEach(child => traverseTreeDFS(child, callback));
  }
}
364 chars
13 lines

index.tsx
function traverseTreeBFS(root, callback) {
  // create a queue and add the root node to it
  const queue = [root];
  
  // loop while the queue is not empty
  while (queue.length > 0) {
    // get the first node from the queue
    const node = queue.shift();
    
    // call the callback function on the current node
    callback(node);
    
    // if the node has children, add them to the queue
    if (node.children && node.children.length > 0) {
      node.children.forEach(child => queue.push(child));
    }
  }
}
520 chars
19 lines