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.

Given a n-ary tree, count number of nodes which have more number of children than parents - GeeksforGeeks

Life as an N-ary Tree – My Cup of Tea

graphs - What does pre-, post- and in-order walk mean for a n-ary tree? - Computer Science Stack Exchange

Special Trees

Complete N-ary Trees

Binary/ N-ary Trees Tutorials & Notes, Data Structures

Implementing Binary Search Tree and n-ary Tree in Javascript, by Khushboo Taneja

N-ary Tree - Tree Data Structures - InterviewBit

Deep Dive into Data structures using Javascript - General (Generic, N-ary) tree - Şahin Arslan

Create a mirror of an m–ary tree

Leetcode 1522. Diameter of N-Ary Tree

n-ary tree functions (coNCePTuaL User's Guide)