Data Structures are the way of programming for sorting data to help using them efficiently. Every commercial and big application use multiple types of data structure concept to optimize and speed up their application.

Below are the foundation terms of data structure.

• Interface – Interface is defined as the set of operations a data structure can perform, parameters type and return type it can accept.

• Implementation – Implementation is the internal representation of data structure. It provides the definition of the algorithm used in operations of the data structure.

Data structure have pretty basic and fair characteristics like is it correct or not, how much time it is taking to perform and how many resources it needs to complete.

• Correctness – Data structure should implement the interface correctly.

• Space Complexity– Space complexity provides the memory space used for the implementation. Data structure helps in using lowest possible memory.

• Time Complexity – It makes sure the execution time is minimum.

To compare various data structure’s time of execution there are 3 cases defined.

1. Worst Case – When the data structure operation takes the maximum time it’s called the worst case. Suppose if a data structure operation’s worst-case time is ƒ(n) then this operation will not take more ƒ(n)time where ƒ(n) represent functions of n.

1. Average Case – When