The tree is a data structure consist the tree node and organized hierarchy. Each node contains value and list of reference to nodes.

The tree has a collection of nodes and all then nodes connected directly or indirectly to root node. The tree supports insert, delete, search, traversal operations. The tree data structure is useful when the data needs to be sorted or represent the data in hierarchical order (example Dir structure from computers), routing algorithms and more.

Tree section explains how to implement the tree and various applications related with tree operation.

Data structure problems
65 Tree Implementation
Write a program to represent the tree. The tree is a hierarchical structure. It contains root node and subtrees of children. A tree made up of nodes or vertices and edges without having any cycle.