Interview Prep

Interview Prep

1. Algorithms

   • Quick Sort
   • Merge Sort
   • Radix Sort
   • Binary Search

2. Data Structures

   • Linked Lists
   • Graphs
     • Tree
       • Binary Tree
         • Binary Search Tree
         • Complete
           • A complete tree is a binary tree in which every level of the tree is fully filled, except for perhaps the last level. To the extent that the last level is filled, it is filled left to right.
         • Full
           • A full binary tree is one which every node has either zero or two children.  No nodes have only one child.
         • Perfect
           • A perfect binary tree is on that is both full and complete. All leaf nodes will be at the same level, and this level has the maximum number of nodes.
         • Binary Heaps
           • Min Heap
           • Max Heap
         • In-order Traversal
         • Pre-order Traversal
         • Post-order Traversal
       • kd Tree
       • Trie
     • Directed
   • Hashtables