Tree

Tree

1. Introduction

   • Data structure in which one node is connected with several other nodes and those nodes are connected to several other nodes
   • It represents data which contains hierarchical relationship between elements.

2. Advantages

   • Reflects structural relationship between the records of data
   • Insertion and searching can be done efficiently in trees
   • Trees are very flexible data structures, allowing to move sub-trees around with minimum efforts.

3. Terminologies

   • Node: every element in tree
   • Root:Node placed at top
   • Leaf Node: bottom most node
   • Degree of node: total No. of child node
   • Level of node: The generation of node

4. Types

   • General tree: All nodes have any No. of child nodes.
   • Binary tree: Any node can have maximum two child node
   • Binary search tree: The left subtree of a node contains only nodes with keys lesser than the node’s key. The right subtree of a node contains only nodes with keys greater than the node’s key.