Table of Contents

    Types of Trees in Data Structures: Explained

    Rumman Ansari July 05, 2024 7,468 views Subject Details

    Data frequently contain a hierarchical relationship between various elements. The data structure which reflects this relationship is called a rooted tree graph or simply a tree. Among the different types of data structures  in practice, a tree is very important to store and manipulate data with a complex relationship. This is sometimes like the properties of an object. For example, properties to store of an employee in the office directory can be named, age, sex, salary etc. Again the properties “name” can have sub-properties like first name, middle name, last name etc. This can be shown as follows.

    There are different types of tree data structures. Some of them are

    1. Binary Tree
    2. Complete Binary Tree
    3. Binary search tree
    4. AVL tree or height-balanced binary tree
    5. Red-Black tree
    6. Splay tree
    7. N-ary tree
    8. Trie Structure
    9. Suffix tree
    10. Huffman Tree
    11. Heap Structure 
    12. B-Tree
    13. B+- tree
    14. R-Tree
    15. Counted-B Tree
    16. K-D tree ( or K- dimensional BST)
    17. Decision tree ( a variant of the n-ary tree)
    18.  Markel tree,
    19. Fenwick tree ( or binary index tree)
    20. Range Tree.