#590 - N-ary Tree Postorder Traversal

Easy • View on LeetCode • View on GitHub

Problem Description

Given the root of an n-ary tree, return the postorder traversal of its nodes' values.

Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)

Solution

/**
 * // Definition for a _Node.
 * function _Node(val,children) {
 *    this.val = val;
 *    this.children = children;
 * };
 */

/**
 * @param {_Node|null} root
 * @return {number[]}
 */
var postorder = function(root) {
  const result = [];
  traverse(root);
  return result;

  function traverse(node) {
    if (!node) return;
    node.children.forEach(child => traverse(child));
    result.push(node.val);
  }
};