Data Structure Operations Data Structure Time Complexity Average Access Search 0(1) Array Stack o(n) Singly-Linked List (n) Doubly-Linked List (n) Skip List 0(log(n)) Hash Table Binary Search Tree Cartesian Tree B-Tree Red-Black Tree Splay Tree AVL Tree o(n) B o(n) o(n) 0(log(n)) E 0(1) O(log(n)) 0(log(n)) 0(log(n)) O(log(n)) O(log(n)) Insertion O(A) 0(1) 0(1) 0(1) 0(log(n)) 0(1) Deletion o(n) 0(1) 0(1) C O(log(n)) 0(1) Worst Access A o(n) D 0(log(n)) 0(log(n)) O(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) 0(log(n)) O(log(n)) 0(log(n)) O(log(n)) F O(n) ILL o(n) O(n) O(log(n)) o(n) Search O(n) O(n) O(n) O(n) o(a) O(n) O(n) Insertion Deletion o(n) o(n) 0(1) 0(1) O(n) 0(1) 0(1) O(n) O(n) O(n) 0(1) 0(1) O(n) O(n) O(n) Space Complexity Worst O(n) O(n) o(n) O(n) O(n) 0(log(n)) 0(log(n))] 0(log(n)) O(log(n)) O(log(n)) O(log(n)) O(n) O(log(n)) O(log(n)) O(log(n)) O(n) O(n) 0(log(n)) O(log(n)) 0(log(n)) 0(log(n)) O(n) O(n) O(n) O(A) On log(n)) O(n)

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.