Limit Tree Height with Deletions

Question

You work with an N-ary tree: every node has an integer id and an ordered list of children. Nodes can be deleted. Deleting a node removes only that node. Its children are promoted: each one takes the deleted node's place under that node's parent, so nothing below it is lost. Splicing an element out of a linked list works the same way. ...