Compress Nodes In N-ary Tree

Question

The input is an n-ary tree whose node values are all unique, together with a list compressedNodes. Every node named in that list must be compressed. To compress a node, delete it and hand its children to its parent: they take the deleted node's position among the parent's children, in their original order. compressedNodes never names the root. Return the root of the tree that results. ...