AlgoDS/DataStructure
-
StackAlgoDS/DataStructure 2020. 1. 16. 23:04
1. Overview Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). 2. Description 2.1 Operations 2.1.1 Push Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition. 2.1.2 Pop Removes an item from the stack. The items are popped in the reversed..
-
QueueAlgoDS/DataStructure 2020. 1. 16. 23:04
1. Overview A Queue is a linear structure that follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we..
-
Linked ListAlgoDS/DataStructure 2020. 1. 16. 22:55
1. Overview A linked list is a linear data structure where each element is a separate object. Also, each element that is also called as a node of the Left comprises two items that are data and the reference to the next node. The most important feature of the lean left is that it is of variable size. 2. Description 2.1 Difference between the linked list and array 2.1.1 Separated object First and ..
-
Binary HeapAlgoDS/DataStructure 2020. 1. 16. 12:46
1. Overview Basically, the idea is that the heap gets filled from the top to the bottom of the fill the top node first and then you build the left child and then you build the right child and then the next note if you want to add it to this heap you basically put it to the left and then to the right and then you put the love child and then the right child. So basically you build it on the way do..
-
Binary Search TreeAlgoDS/DataStructure 2020. 1. 13. 10:19
1. Overview Unlike other sequential structures such as linked list, queue, stack, and array, which are one element after another and sort of a line of things, It has a hierarchical data structure like a tree. A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child. Root: T..
-
GraphAlgoDS/DataStructure 2020. 1. 13. 01:18
1. Overview A Graph consists of a finite set of vertices(or nodes) and a set of edges that connect a pair of nodes. 2. Description 2.1 Components 2.1.1 Edge In the above Graph, the set of edges E = {(0,1), (1,2), (2,3), (3,4), (0,4), (1,4), (1,3)}. 2.1.2 Vertice In the above Graph, the set of vertices V = {0,1,2,3,4} 2.1.3 Adjacency matrix Represents graph with 'V' nodes into a VxV 0-1 matrix wh..
-
Choosing the appropriate Data StructureAlgoDS/DataStructure 2019. 9. 4. 21:14
1. Overview Data structures are the way to store and retrieve data like accessing data using an index in an array or a named key to store and retrieve information from a dictionary. Choosing the appropriate data structure enhancing inputting, processing, maintaining, retrieving information. For performance, the developer should choose the right data structure. 2. Description Data Structure Descr..