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.

N-ary Tree

Tree

Special Trees

1516 - Move Sub-Tree of N-Ary Tree

Moving from an N-ARY tree to a childbrother tree

Create a mirror of an m–ary tree

N-ary Tree Data Structure - Studytonight

Binary tree - Wikiwand

Leetcode 1522. Diameter of N-Ary Tree

Maximum value at each level in an N-ary Tree - GeeksforGeeks

Possible number of Trees having N vertex - GeeksforGeeks

AVL Trees

Guide to AVL Trees in Java

Expression Tree in C++ (Construction with Example)