Featured

Intro into 8 basic Data Structures

Hello, this blog contains the basic concepts and applications of array, vector, linked list, stack, queue, priority queue, binary tree, binary search tree, heaps, threaded binary tree, graphs and hash tables.

Featured

Intro into #Hashing ?

Hello, this blog contains the basic concept of hashing, hashing terminologies, various hashing functions, various collision resolution strategies, chaining with and without replacement, chaining using linked list and extendible hashing. At the end it contains link to a GitHub repository, along with my another blog on encryption and decryption. Concept of Hashing: To search for […]

Featured

Basics of Graphs

We will be covering what are graph data structures, along with how to represent them, traverse them, find minimum spanning tree using prim and kruskal, finding short path using dijkstra and sort the graph using topological sort.

Binary Search Tree

picture credits :http://turnoff.us/image/en/binary-tree.png So we have binary tree , but it was not sorted in a way . So difference between a binary tree , So we follow the nomenclature used below , Our class will look like, 1.Create: Same as Binary Tree , except we don’t give user the choice to select position in […]

Featured

Trees to Binary Trees

picture credits :http://turnoff.us/image/en/binary-tree.png There are three types of trees we will be discussing , General Trees : A tree is a finite set of nodes with one specially designated node called the root and the remaining notes are partitioned into n>=0 disjoint sets T1 and Tn where each of those sets is a tree.T1 to […]

Featured

Linked List

A linked list may be defined if all the block are linked to each other ,using address of the blocks . It’s different from an array , as an array is a collection of simultaneous boxes , where as list is collection of boxes which are connected by a string . An Example of Linked […]

Types of Lists :

1.Circular List A Circular list , has the next of last node pointing towards the first node of the list , so in algo terms : rear->next =front; This forms a circle of nodes as now last node and first node is connected , just like a circle : Now why Circular Link list , […]

Stacks and Queues using linked list

Concept of Stack and Queue Stack : Now stack works on the concept of LIFO , which means last element in will be the first element out . For only understanding purpose we take stack to be horizontal , For our conceptual understanding consider a stack of plates example , you have to put plate […]

Data Structures

Data Structure is a way of collecting and organizing data ,such that we can optimize our code . For example 1.You can either Store data in tuple or list , depending on operations you want to perform. 2. You can either use yield function use in python or declare data type to store temporary data.As […]