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.

Read More Intro into 8 basic Data Structures
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 […]

Read More Trees to Binary Trees
Featured

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 […]