DataStructureAugmentation.md (395B)
1 # Data Structure Augmentation 2 3 L2 4 5 **Definition:** Data structure augmentation is adding something to a data structure to improve it in some way. 6 7 An example of this is to improve a singly linked list with a tail pointer so polling the tail can be done in O(1) instead of O(n) time. By doing this we could also have constant time additions onto the end of the list (ensure pointer is updated).