Data Structures

common operations of an Array.

Ans: index

OperationsofQueue.

Enqueue: Add an element to the end of the queue Dequeue: Remove an element from the front of the queue IsEmpty: Check if the queue is empty IsFull: Check if the queue is full Peek: Get the value of the front of the queue without removing it

Binary Max Heap

It is a collection of linked data structures called nodes. Each node contains a piece of data called a key. Each node contains a pair of pointers (or references) to two other nodes. There are no cycles (circular references) in the structure. The key at the root node has the maximum key value among all nodes. The key of any node has a value >= all key values in its sub-trees If y is a node in the left subtree of node x, then y.key <= x.key. The keys are always stored to satisfy the max heap property The key at the root node has the maximum key value among all nodes. The key of any node has a value >= all key values in its sub-trees

Red-Black Tree.

It is a collection of linked data structures called nodes. Each node contains a piece of data called a key. Each node contains a pair of pointers (or references) to two other nodes. There are no cycles (circular references) in the structure. Each node has an extra bit of data that is used to ensure the structure remains approximately balanced during insertions and deletions.

Directed Graph

It is a collection of nodes called vertices. Its edges are one-directional. It includes a set of edges that connect pairs of nodes. There may be cycles (circular references) in the structure.

Array

It is a linear ordered collection of values called elements. It has a fixed size. All of the elements are of the same type. All of the elements are located contiguously in memory. It supports direct access by index.

Array List

It is a linear ordered collection of values called elements. It has a variable size. All of the elements are of the same type. All of the elements are located contiguously in memory. It supports direct access by index.

common operations of a Priority Queue.

insert, maximum, extract_max, increase_key pull or extract?

common operations of a Stack.

push, pop, peek

common operations of a Hash Table?

search, insert, delete

common operations of a Linked List?

search, insert, delete

common operations of an Binary Search Tree?

search, insert, delete, minimum, maximum, predecessor, successor

Binary Tree.

• Each node contains a pair of pointers (or references) to two other nodes. • It is a collection of linked data structures called nodes. • Each node contains a piece of data called a key. There are no cycles (circular references) in the structure.

AVL Tree.

• Each node contains a pair of pointers (or references) to two other nodes. • The heights of the two child sub-trees of any node can differ by at most one. • There are no cycles (circular references) in the structure. Each node contains a piece of data called a key.

Splay Tree.

• Each node contains a pair of pointers or references to two other nodes. • Each node contains a piece of data called a key. If y is a node in the right subtree of node x, then y.key >= x.key The keys are always stored to satisfy the Binary Search Tree property.

Linked List.

• Each node contains a piece of data called a key. • Each node contains a pointer or reference to another node. • It is a linear ordered collection of linked data structures called nodes It has a variable size.

2-3 Tree.

• Each node has either two children and one data element or three children and two data elements. • It is a collection of linked data structures called nodes. • There are no cycles (circular references) in the structure Each node contains a piece of data called a key.

Binary Min Heap

• It is a collection of linked data structures called nodes. • Each node contains a piece of data called a key. • Each node contains a pair of pointers (or references) to two other nodes. • There are no cycles (circular references) in the structure. • The key at the root node has the minimum key value among all nodes. • The key of any node has a value <= all key values in its sub-trees • If y is a node in the right subtree of node x, then y.key >= x.key.

Binary Search Tree

• It is a collection of linked data structures called nodes. • If y is a node in the right subtree of node x, then y.key >= x.key. • The keys are always stored to satisfy the Binary Search Tree (BST) property There are no cycles in the structure

Graph

• It is a collection of nodes called vertices. • There may be cycles (circular references) in the structure. • It includes a set of edges that connect pairs of nodes

Hash Table

• It is a collection of values mapped to keys. • The underlying data structure is often an array. • It uses a hash function to compute an index into an array of buckets or slots, from which the desired value can be found or stored.

Singly Linked List.

• It is a linear ordered collection of linked data structures called nodes. • Each node contains a piece of data called a key. • It has a variable size. Each node contains a pointer or reference to another node.

Doubly Linked List

• It is a linear ordered collection of linked data structures called nodes. • It has a variable size. • Each node contains a piece of data called a key. • Each node contains a pair of pointers or references to two other nodes.

Queue.

• It is a linear ordered collection of values. • The underlying structure is often an array or a linked list. • The values are stored and removed to satisfy first-in-first-out (FIFO) access property.

Priority Queue.

• It is a linear ordered collection of values. • The values are stored and removed to satisfy the property that an element with high priority is served before an element with low priority. • The underlying structure is often a heap.

Weighted Graph.

• Its edges each include a weight value. • It includes a set of edges that connect pairs of nodes. • It is a collection of nodes called vertices There may be cycles (circular references) in the structure.

Stack.

• The underlying structure is often an array or a linked list. • It is a linear ordered collection of values. • The values are stored and removed to satisfy last-in-first-out (LIFO) access property.

Circularly Linked List.

•• It is a linear ordered collection of linked data structures called nodes. • It has a variable size. • Each node contains a piece of data called a key. • Each node contains a pointer or reference to another node. • The last node in the sequence contains a pointer (or reference) to the first node in the sequence.