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-array Tree in Discrete Mathematics - javatpoint
Depth of an N-Ary tree - GeeksforGeeks
m-ary tree - Wikiwand
graphs - What does pre-, post- and in-order walk mean for a n-ary tree? - Computer Science Stack Exchange
Serialise Deserialise N-ary Tree - GoHired
Deep Dive into Data structures using Javascript - General (Generic, N-ary) tree - Şahin Arslan
N-ary Tree
Number of siblings of a given Node in n-ary Tree - Coding Ninjas
Complete N-ary Trees
Maximum Depth of N-ary Tree Leetcode Solution, In this prob…
Sum of all elements of N-ary Tree - GeeksforGeeks