Which data structure has fastest insertion procedure?
Answers
Answered by
0
python because it is the most easy computer language to use
Answered by
0
Data structure refers to the organisation and storage of data in a systematic and efficient way which is easy to retrieve when needed.
There are several types of Data Structures available.
Primitive data types, abstract data types, binary trees, array, B-tree, heap nd trie are some of the major data structure.
Amongst these, a balanced binary tree has the fastest insertion procedure with a complexity of O(logn).
Similar questions