Please enable JavaScript.

Coggle requires JavaScript to display documents.

Tree data structure - Coggle Diagram

- - - - Each node can only have either 0, 1, or 2 children . 2.Each node can only have 1 parent node.
    - - Full Binary tree
        
        Each node has either 0 or 2 children .
        
        Each node has only 1 parent node.
      - Perfect Binary tree
        
        Each node has either 0 or 2 children .
        
        Each node has only 1 parent node.
        
        All the leaf nodes are at same level .
        
        total number of nodes at last level = number of rest nodes + 1.
        
        It is more efficient ,We have half of this data in the bottom level. If somehow we can avoid visiting every node even if the node we're looking for is at the very bottom perhaps there is some efficiencies.
      - Binary search tree
        
        properties
        
        ➡️ Each node has either 0,1, 2 child nodes . ➡️ Each node has 1 parent .
        ➡️ For each node, value of all the nodes in left subtree is lesser or equal and value of all nodes in right subtree is greater .
        
        pros
        
        ➡️It allows us to organize data as one parent folder that contains different sub folders , which other data structure ( array, linked list, hash table ) not allows .
        ➡️fast searching and lookup .
        
        cons
        
        ➡️when we insert and delete node from tree we need to perform reordering and shifting .
        
        complexity