Sequential containers vector -consecutive memory storing High performance in random access and ending element operations Low in inserting and deleting inner elements(moving) Could be used as stack a list- double linked memory units High performance in inserting and deleting on any positions Low in random access(traversing) Could be used as linked table a deque -consecutive memory storing High performance in random access and head and tail elements operations ow in inserting and deleting Could be used as queueSequential Containers ◼ vector – consecutive memory storing ◼ High performance in random access and ending element operations ◼ Low in inserting and deleting inner elements (moving) ◼ Could be used as stack ◼ list – double linked memory units ◼ High performance in inserting and deleting on any positions ◼ Low in random access (traversing) ◼ Could be used as linked table ◼ deque – consecutive memory storing ◼ High performance in random access and head and tail elements operations ◼ Low in inserting and deleting ◼ Could be used as queue