This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges).
Refer to the Solution Notebook. If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start.
In [ ]:
    
class Node(object):
    def __init__(self, data):
        # TODO: Implement me
        pass
class Queue(object):
    def __init__(self):
        # TODO: Implement me
        pass
    def enqueue(self, data):
        # TODO: Implement me
        pass
    def dequeue(self):
        # TODO: Implement me
        pass
    
In [ ]:
    
# %load test_queue_list.py
from nose.tools import assert_equal
class TestQueue(object):
    # TODO: It would be better if we had unit tests for each
    # method in addition to the following end-to-end test
    def test_end_to_end(self):
        print('Test: Dequeue an empty queue')
        queue = Queue()
        assert_equal(queue.dequeue(), None)
        print('Test: Enqueue to an empty queue')
        queue.enqueue(1)
        print('Test: Dequeue a queue with one element')
        assert_equal(queue.dequeue(), 1)
        print('Test: Enqueue to a non-empty queue')
        queue.enqueue(2)
        queue.enqueue(3)
        queue.enqueue(4)
        print('Test: Dequeue a queue with more than one element')
        assert_equal(queue.dequeue(), 2)
        assert_equal(queue.dequeue(), 3)
        assert_equal(queue.dequeue(), 4)
        print('Success: test_end_to_end')
def main():
    test = TestQueue()
    test.test_end_to_end()
if __name__ == '__main__':
    main()
    
Review the Solution Notebook for a discussion on algorithms and code solutions.