This is a LinkedList.

Search by key time is O(log N).

Search by key time is O(N).

This is a binary tree.

This is list of arrays.

Hash code is used to find the position of element.

Stores key:value pairs.

The order of insertion is preserved.

Keys are stored in sorted order.

This is array of lists.

Search by key time is O(1).

Search operation may take O(N).

Search operation may take O(log N).

Search operation may take O(N log N).

Each node has exactly two child nodes.

Key of left child node is smaller than key of parent node, key of right child node is larger than key of parent node.

Each node has up to two child nodes.

It is a binary tree.

Root node always stores the largest key.

Left child node has value smaller than parent node and right child node has value bigger than parent node.

Search of element with the highest priority time complexity is O(log N).

Elements must be comparable by priority.

The values in child nodes have values smaller than parent node.

This is binary search tree.

Insertion time complexity is O(log N).

This is binary tree.

Root stores element with the highest priority.

Data may be stored as sorted list.

This is B-tree.

This is stack.

The order of element read is first-in-first-out.

Element with highest priority is at the top of data structure for fast access.

The order of element read is last-in-first-out.

Data may be stored in heap tree.

Time complexity O(log N)

Has two stages: recursive partition of data elements into parts and merge of data elements.

Time complexity O(N log N)

One element is selected and other elements are placed to the left or right of that element.

Uses auxiliary memory.

Sorting performance time depends on the selection of gap.

Time complexity O(log N)

Uses auxiliary memory.

Time complexity O(N log N)

Has two stages: elements recursively are divided into two parts, then parts are merged in sorted way.

Sorting performance time depends on the selection of

gap.

Recursively one element is selected and other elements are placed to the left or right of that element.

Uses insertion sort as subroutine.