Tree

A tree is recursively defined as a set of one or more nodes where one node is designated as the root of the tree and all the remaining nodes can be partitioned into non empty sets each of which is a sub tree of the root.

Tree Data Structure

TYPES OF TREES

Trees are following types of Trees :

  1. General trees
  2. Forests
  3. Binary trees
  4. Binary search trees
  5. Expression trees
  6. Tournament trees

Find Full Material Here:

TREE – IMPORTANT Full MATERIAL PPT PDF

Also Read :

What is the difference between Binary Tree, Binary Search Tree, AVL Tree, 2-3 Tree and B-trees?

<< Prev – Non Linear Datastructures
Next – Graphs >>