Category Archives: Uncategorized

 Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph. Basic Terminology used in Graphs. Lets develop good understanding of the basic of GRAPHS. [Click the following links to watchContinue reading “Graphs”

In many cases, it has been realized that in a binary search tree, many nodes have an empty left child or empty right child or both. Threaded Binary tree is an attempt to utilize these fields in such a way so that the empty left child of a node points to its inorder predecessor andContinue reading “Threaded Binary Tree”

This tree is named after their inventors, Adelson-Velskii and Landis (AVL). An AVL tree is a balanced binary search tree. In this tree, pairs of sub-trees differ in height by at most 1, maintaining cost of operations to O(logn) time. Properties The sub-trees of every node differ in height by at most one Every sub-tree is an AVL tree. Balance FactorContinue reading “AVL Trees (Adelson-Velskii and Landis)”

Binary Search Tree (BST) is a collection of nodes where each node has a key and an associated value. The tree maintains an order property which means that node are arranged in such a way that value less than root value exist in left sub-tree and values more than root-value exist in right sub-tree. EveryContinue reading “Binary Search Trees”

Emerging Computing Paradigms: Principles, Advances, and Applications Published by WILEY

A spanning tree is a sub-graph of an undirected connected graph, which includes all the vertices of the graph. If this sub-graph is achieved with minimum cost edges then it is said to be minimum spanning tree (MST) A greedy algorithm is an algorithm that is generally used in optimization problems. This algorithm makes the least expensiveContinue reading “Minimum Spanning Tree / Greedy Algorithms”

Tree is a fundamental data structures. It is non linear in nature. It is defined as a collection of elements(known as nodes) in which one element is special ( called as root) which represent the first element of this collection. Applications of tree To represent hierarchical relations among elements For efficient searching through binary searchContinue reading “Understanding Tree”

Introduction to QUEUE data Structure How to Implement Linear QUEUE using Array and Linked List Introduction to Circular Queue and Its implementation Understanding CIRCULAR QUEUE Operations with an Illustrative EXAMPLE

Stack is a commonly used abstract data type which works on the principle of LIFO(Last in First out) It has two major operations, namely PUSH and POP. PUSH adds an element at the top of the stack and POP removes an element from top of the stack. Software implementations of the stack are done usingContinue reading “Lets Explore STACKs”

Heaps are regular binary trees with two special characteristics. (i) Complete Tree (ii) Order Property Heaps must be Complete Binary Trees. With order property it means that every node must have more(less) or equal key values than its child nodes. Heap is a special data structures that are useful for specific use-cases such as sorting andContinue reading “Understanding Heap”