Basics of Tree data structure

Tree data structure simulates a hierarchical tree structure, with root and subtrees represented by linked nodes.

Some Terminology

Root : Top node in tree.
Child : Node directly connected to parent node.
Siblings : Child nodes with same parent.
Ancestor : A node reachable by repeated proceeding from child to parent.
Leaf : A node with no children.

Breadth first search of graph