Please enable JavaScript.

Coggle requires JavaScript to display documents.

Code Interview - Coggle Diagram

- - - - Links to prefix
      - Insert/Search O(n)
    - - Insertion/Deletion: log(n) /top: o(1)
      - build a heap is O(n)
      - pQueue.poll() (Deletion) / pQueue.peek() (Top)
      - Python: heapq.heapify(lista) / heapq.heappush(lista,4) / heapq.heappop(li))
    - - Not Balanced
        
        Search/Insertion/Deletion: o(n)
      - AVL/Balanced
        
        Search/Insertion/Deletion: o(logn)
  - - - First in, First Out (FIFO)
    - - Last In, First Out (LIFO)
- - - - Selects always the smallest element
      - Complexity: Time n^2
    - - Pivot elements
      - Complexity: Time n^2
    - - Inserts element on the right position
      - Complexity: Time n^2
    - - Complexity: Time: n*log(n)
      - Divide and Conquer
  - - - Pre Order: Root; Left-side; Right Side
      - In-order: Left; Root; Right;
      - Pos Order: Left; Right; Root;
    - - recursive
      - was Visited Tag
      - O(V + E)
    - - More Efficient
      - O(V + E)
      - Always find the shortest path in unweighted graphs