Please enable JavaScript.

Coggle requires JavaScript to display documents.

Data Scientist - Coggle Diagram

- - - - Types
        
        🎁Static
        
        🎁Dynamic
      - Searching. Is it sorted?
        
        Yes - Divide & Conquer - Binary Search O(log n) 🚀
        
        No - Will sorting make it faster? If still no, Linear Search O(n)🚀
        
        No. Is it a String? See if a 🎁Tree data structure helps
      - String question?
        
        Turn it into an Array - split()
    - - Collision?
        
        Linked List
      - ** could be O(n) with hash collisions and dynamic array resizing but unlikely
    - - 🎁Singly Linked List
      - 🎁Doubly Linked List
    - - Using Array
      - Using Linked List
    - - 🎁Binary Trees
        
        Types
        
        Perfect Binary Tree
        
        Full Binary Tree
        
        🎁Binary Search Tree
        
        🎁Balanced BST
        
        🎁AVL Tree
        
        🎁Red Black Tree
      - 🎁Heap
        
        🎁Binary Heap
        
        Priority Queue
      - 🎁Trie
      - Tree Traversal? O(n)
        
        Recursion?
        
        Be mindful of Space Complexity!! (Stack overflow)
        
        🚀Depth First Search (DFS)
        
        Inorder
        
        Postorder
        
        Preorder
    - - Types
        
        Based on Direction
        
        Directed
        
        Undirected
        
        Based on Weights
        
        Weighted
        
        Unweighted
        
        Based on connection between Nodes/Vertexes
        
        Cyclic
        
        Acyclic
      - Graph Traversal? O(n)
        
        🚀Breadth First Search (BFS)
      - Sortest Path?
        
        🚀Bellman-Ford
        
        🚀Dijkstra
    - - Using Array (Bad)
      - Using Linked List
      - Using Stacks
  - - - Be mindful of Space Complexity! (Stack Overflow)
      - 🎁Trees
    - - 🚀Quick Sort O(n^2)
      - 🚀Heap Sort O(n logn)
      - 🚀 Merge Sort O(n logn)
      - 🚀Bubble Sort O(n^2)
      - 🚀Selection Sort O(n^2)
      - 🚀Insertion Sort O(n^2)
      - 🚀Radix Sort O(nk)
      - 🚀Counting Sort O(n+k)
    - - 🚀Linear Search O(n)
      - 🚀Binary Search O(log n)
      - 🚀Breadth First Search
    - - 🚀Memoization