Renamed class MyQueue -> DeQueue : temporary name which wasn't cleaned up.
Updated the implementation of DataStructures/veb_tree.py to massively reduce its space requirement.

Extra nodes are now created when required, and deleted when empty. Doesn't affect time complexity of insert/delete, however greatly reduces total space complexity (the tree doesn't have to be created in full initially).
Fixed successor() and predecessor() methods in DataStructures/veb_tree.py

Both successor() and predecessor() were not written to handle the case of empty nodes having no cluster array. This was fixed by including a check to see if the node was empty, and if so, just returning None (no successor/predecessor in this case).
Added extra test cases to Sorting/tests.py

Now also check for an input consisting entirely of zeros, and an input consisting of just a single value repeated.
Added extra tests to DataStructures/tests.py for BinarySearchTree and BinaryTree
Added extra tests to DataStructures/tests.py for LinkedList
Added extra tests to DataStructures/tests.py for Stack
Added extra tests to DataStructures/tests.py for vEBTree