Trees

Trees

1. A tree is a data structure made up of nodes.

2. Characteristics of trees

   • Non- linear data structure
   • Searching as fast as in ordered array.
   • Insertion and deletion as fast as in linked list

3. Binary Tree

   • The first subjet contains a single element called the root of the tree.
   • A left or right bub-tree can be empty
   • Each element of a binary tree is called node of the tree
   • Binary Search Tree
     • A binary search tree is basically a binary tree, and therefore it can be traversed in:
       • Inorden
       • Preorder
       • Postorder

Images and files in the map