Please enable JavaScript.

Coggle requires JavaScript to display documents.

Abstract Data Types - Coggle Diagram

- - - - Data Structures
        
        Hash Table
        
        Dealing with collisions
        
        Chaining
        
        Open addressing
        
        Linked list
    - - When the set of keys is an Totally ordered set for some total order relation
      - Main differene is that if you that TOS then we can do some operations more efficently
      - Data Structure
        
        Sorted array
        
        Binary Search Tree
        
        INORDER TRAVERSAL OF BST
        
        Return the elements in sorted order
        
        Use this to define the predecessor and successor of an element
        
        INVARIANT
        
        For every node we have the value/data is more than or equal to(related or comparator ) the data in all the nodes of its left subtree and less than the data all the nodes of the right subtree
      - Slight difference in the defination of an find operation where if No then we also return the immediate predecessor and successor
        
        WHY WE DID SO ??