#sequencialaccess

[raulbento]

Basic Data Structure (English)

1. What is Data Structure?

Data structure is a way of defining, storing and retrieving data in a structural and systematic way.

2. Sequential access

It means that a group of elements is accessed in a predetermined sequence.

ArrayList: Re-sizable-array implementation of the List interface. Implements all optional list operations, and permits all elements, including null. It is unsynchronized.

Vector:  It is a synchronized ArrayList. It means its thread safe.

3. Linked List 

Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null). It stores the data in nodes that connect with the previous and next nodes since it’s doubly-linked. It could also be singly-linked.

4. Graph

A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links.

5. Stack

Every new elements will be added as the first element, and only the first element can be removed.  The order in which elements come off a stack gives rise to its alternative name, LIFO (for last in, first out). 

6. Queue

Every new elements will be added as the last element, and only the first element can be removed. This makes the queue a First-In-First-Out (FIFO) data structure.

7. Heap

It is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly.

8. Tree

A tree is a minimally connected graph having no loops and circuits.

Binary Tree: A binary tree has a special condition that each node can have two children at maximum.

Binary Search Tree: A binary search tree is a binary tree with a special provision where a node's left child must have value less than its parent's value and node's right child must have value greater than its parent value.

AVL Tree: It is height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor.

Spanning Tree: A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. A spanning tree does not have cycles and it cannot be disconnected.

9. Set

It can store values without any particular order and no repeated values. It is a computer implementation of the mathematical concept of a finite set. Other variants, called dynamic or mutable sets, allow also the insertion and deletion of elements from the set.

10. Map

It is an object that maps keys to values. A map cannot contain duplicate keys and each key can map to at most one value. Map doesn’t implements Collection because it contains a key and a value.