We know that a binary tree is a rooted tree in which each node has no more than two children. We can extend this definition to an n-ary tree. If a tree is rooted in which each node has no more than n children, it is called an n-ary tree. In other words, n ary trees are tree data structures with up to n children nodes for each node present in the tree.
Delete N-ary Tree Node
Serialize and Deserialize n-ary tree - Java2Blog
Implementing Binary Search Tree and n-ary Tree in Javascript, by Khushboo Taneja
16: A complete n-ary tree graph with parameters m = 3, n = [3, 2, 3].
Number of ways to traverse an N-ary tree - GeeksforGeeks
Special Trees
771.Encode N-ary Tree to Binary Tree · GitBook
N-ary tree Level Order Traversal - Coding Ninjas
N-ary Tree - Tree Data Structures - InterviewBit
