import linkedList
'''
TODO:
    -Data Structures:
        -Linked Lists
        -Trees, Tries, Graphs
        -Stacks & Queues
        -Heaps
        -Vectors / ArrayLists
        -Hash Tables (** very important)
    -Algorithms:
        -Breadth First Search
        -Depth First Search
        -Binary Search
        -Merge Sort
        -Quick Sort
    -Concepts:
        -Bit Manipulation
        -Memory (Stack vs. Heap)
        -Recursion
        -Dynamic Programming
        -Big O time and space.
'''
def main():
    print("hi i'm in main!")

if __name__ == "__main__":
    main()
import linkedList
'''
TODO:
    -Data Structures:
        -Linked Lists
        -Trees, Tries, Graphs
        -Stacks & Queues
        -Heaps
        -Vectors / ArrayLists
        -Hash Tables (** very important)
    -Algorithms:
        -Breadth First Search
        -Depth First Search
        -Binary Search
        -Merge Sort
        -Quick Sort
    -Concepts:
        -Bit Manipulation
        -Memory (Stack vs. Heap)
        -Recursion
        -Dynamic Programming
        -Big O time and space.
'''
def main():
    print("hi i'm in main!")

if __name__ == "__main__":
    main()
TODO:     -Data Structures:         -Linked Lists         -Trees, Tries, Graphs         -Stacks & Queues         -Heaps         -Vectors / ArrayLists         -Hash Tables (** very important)     -Algorithms:         -Breadth First Search         -Depth First Search         -Binary Search         -Merge Sort         -Quick Sort     -Concepts:         -Bit Manipulation         -Memory (Stack vs. Heap)         -Recursion         -Dynamic Programming         -Big O time and space.