A data structure is a particular technique of organizing data in a computer so that it can be used effectively.
Big O is a notation which explains the performance or complexity of an algorithm .It describes the upper bound of the complexity. Let’s understand…