Linked List Implementation 2


 Stack ?

•Stack is an important data structure which stores its elements in an ordered manner
•Analogy:
  You must have seen a pile of plates where one plate is placed on top of another. When you want to remove a plate, you remove the topmost plate first. Hence, you can add and remove an element (i.e. the plate) only at/from one position which is the topmost position

 Array Representation
•Stack has two variables:
•TOP which is used to store the address of the topmost element of the stack
•MAX which is used to store the maximum number of elements that the stack can hold
•If TOP = NULL, then indicates that the stack is empty
•If TOP = MAX – 1, then the stack is full
•
•
     0    1   2   3    4   5    6    7   8
•TOP=4, insertion and deletion will be done at this position
Linked List Representation
•Technique of creating a stack using array is easier, but the drawback is that the array must be declared to have some fixed size.
•In a linked stack, every node has two parts:
–One that stores data
–One that stores the address of the next node
•The START pointer of the linked list is used as TOP
•All insertions and deletions are done at the node pointed by the TOP
•If TOP = NULL, then it indicates that the stack is empty
 

Komentar

Posting Komentar

Postingan populer dari blog ini

Pointer, Array and Introduction to Data Structure-fernando-2101637812

Pointer, Array and Introduction to Data Structure •        Array Review •        Pointer Review •        Types of Data Structures •        Abstract Data Type 1. Array        Array adalah kumpulan elemen data yang sama, dimana data tersebut memiliki tipe data yang sama (homogen). Tipe data tersebut dapat berupa integer(angka), char(karakter), floating point (angka berkoma), long(angka yang memiliki kapasitas diatas integer - 2^32), dan double (angka berkoma yang memiliki kapasitas yang lebih besar dari floating point).         Array disimpan dalam memori yang statis, artinya alokasi memori dilakukan saat deklarasi sebuah array. Array sendiri dapat diakses lewat indexnya. Indexnya dimulai dari 0, bukan 1.         Array dapat berupa array 1-dimensi, array 2-dime...
Baca selengkapnya

Tree Concept

Gambar
  DEGREE of TREE = 3 DEGREE of C = 2 HEIGHT = 3 PARENT of C = A CHILDREN of  A = B, C, D SIBILING of F = G ANCESTOR of F = A, C DESCENDANT of C = F, G • Node at the top is called as root . • A line connecting the parent to the child is edge . • Nodes that do not have children are called leaf . • Nodes that have the same parent are called sibling . • Degree of node is the total sub tree of the node. • Height/Depth is the maximum degree of nodes in a tree. • If there is a line that connects p to q, then p is called the ancestor of q, and q is a descendant of p.  Binary Tree Concept • A sample of binary tree of 9 nodes, rooted on node which contains 18. Leaves are nodes which contain 9, 12, 10 and 23.  
Baca selengkapnya

Binary Tree

Gambar
Perfect Binary Tree Complete Binary Tree A Perfect Binary Tree is also a Complete Binary Tree. Skewed Binary Tree Property of Binary Tree the number of numbers of nodes in a K level of a Binary Tree is 2k.   in some literature, the level of the Binary Tree is mesmerized from 1 (Root). The maximum number of inner nodes in a Binary Tree of Height (H) is 2h + 1 - 1 Maximum nodes of a Binary Tree from Height 3 = 1 + 2 + 4 + 8 = 20 + 21 + 22 + 23 = 24 - 1 = 15 The minimum height (Height) of a Binary Tree of n nodes is 2log (n). The maximum height (Height) of a Binary Tree of n nodes is n - 1.
Baca selengkapnya