insertion at end of linked list
Circular Linked List | Insertion | Deletion | Data Structure & Algorithm
CIRCULAR LINKED LISTS In a circular linked list, the last node contains a pointer to the first node of the list. We can have a circular singly linke…
Read more
sorted list
Linked List- Searching into a Sorted List | Insertion | Data Structure & Algorithm
SEARCHING IN LINKED LIST CASE : LIST Is Sorted Suppose the data in LIST are sorted. Again we search for ITEM in LIST by traversing the list using a …
Read more
traversing
Linked List- Intro | Memory Representation | Traversing | Searching | Data Structure & Algorithm
LINKED LISTS A linked list, or one-way list, is a linear collection of data elements, called nodes, where the linear order is given by means of point…
Read more
Time Complexity
Huffman Tree | Huffman Coding | Data Structure & Algorithm
A binary code encodes each character as a binary string or codeword. We would like to find a binary code that encodes the file using as few bits as p…
Read more
tree
AVL Search Tree | Part 2 | Balance Factor| AVL Tree Rotation| LL RR LR RL| Data Structure & Algorithm
AVL Tree Table of Contents •What is the AVL Tree? •Why AVL Trees? •Advantages of AVL tree. •Algorithm for different Operations on AVL. For Inse…
Read more
tree
AVL Tree part 1 | Graph | Data Structure & Algorithm
AVL Tree Table of Contents •What is the AVL Tree? •Why AVL Trees? •Advantages of AVL tr…
Read more
Searching a B-tree
m-way Search Tree | B Tree | B+ Tree | Data Structure & Algorithm
Multiway Trees A multiway tree is a tree that can have more than two children. A multiway tree of order m (or an m-way tree) is one in which a tree c…
Read more
TRAVERSING BINARY TREES
Tree Traversal- in, pre & post | Binary Search Tree | m-way Search Tree | Data Structure & Algorithm
TRAVERSING BINARY TREES There are three standard ways of traversing a binary tree T with root R. These three algorithms, called preorder, inorder an…
Read more
tree traversal
Minimum Spanning Tree- Prims & Kruskal | Binary Tree | Tree Traversal | Data Structure & Algorithm
Prim's Algorithm Prim's algorithm is a greedy algorithm that is used to form a minimum spanning tree for a connected weighted undirected grap…
Read more
TRAVERSING A GRAPH
Graph Traversal BFS & DFS | Minimum Spanning Tree | Kruskal & Prims | Data Structure & Algorithm
TRAVERSING A GRAPH Breadth-First Search The general idea behind a breadth-first search beginning at a starting node A is as follows. First we exami…
Read more
- Prof. Sujeet Kumar Jha
- Hi there, I'm Prof. Sujeet kumar Jha and I teach Data Structure & Algorithm. I have been teaching for over 6 years and have education experience in CSE.
Welcome to my blog. Plz subscirbe my youtube channel
Social Plugin