N-ary Tree
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.
m-ary tree - Wikipedia
Delete N-ary Tree Node
Maximum Depth of N Ary Tree - Leetcode
N-ary Tree - Tree Data Structures - InterviewBit
Maximum value at each level in an N-ary Tree - GeeksforGeeks
Serialize and Deserialize n-ary tree - Java2Blog
m-ary tree - Wikipedia
A 16 node √ n-ary tree with height 2
Print N-ary tree graphically - GeeksforGeeks
Leetcode 1522. Diameter of N-Ary Tree
Number of ways to traverse an N-ary tree - GeeksforGeeks
N-ary tree case - -lca-2 - Coding Blocks Discussion Forum
Create a mirror of an m–ary tree