Adjacency List Code Adjacency List is one of the best way of representing a graph through computer code. In this code, connection in between two adjacent nodes is represented in the adjacency list. This adjacency list is represented using Linked List and one linked list is created for each node\’s adjacent node connection and representation. …
Josephus Problem Solution Code This code is for implementing Josephus Problem using Circular Linked List. Actually Josephus problem is a concept of deleting node on counter basis. If you take a counter of 3 for performing this problem then it will start by deleting the 3rd node starting from the head node, then and after …
Easy Josephus problem solution using Circular Linked List Read More »
AVL Tree Introduction to AVL Tree : AVL trees are a self-balancing binary search tree data structure that helps maintain the height balance of the tree. They were named after their inventors, Adelson-Velsky and Landis, and are particularly useful for optimising search, insertion, and deletion operations. In this guide, we\’ll explore AVL trees, provide an …
Mirror Image Construct of Binary Search Tree This code is for showing Mirror Image construct and Level Order Traversal of a Binary search tree. In this code first the tree is created as per the position of the nodes. As we all know in Binary Search Tree, Left child contain lesser value than parent and …
Easy Mirror Image Construct of Binary Search Tree Read More »
Level Order Traversal of Binary Tree Code This code is for showing Level Order Traversal of a Binary tree creation using queue. In this code first created node will be treated as root node. After that another function insert() will be called for adding the child nodes. Every time one node created and sent to …
Binary Search Tree Creation Code This code is for Binary search tree creation. As we know in Binary Search Tree left sub tree will contain lesser value than the parent and right sub tree will contain greater value than the parent. So in this code nodes are inserted on the basis of there position. After …
Code for implementing Circular Queue using Linked List For learning pointer, dynamic memory allocation, linked list, you should go through this code. This is Code for implementing Circular Queue using Linked List. In C code practice, this Code for implementing Circular Queue using Linked List logic plays a very important role. So I have designed …
Binary Tree Creation using Stack code This code is for Binary tree creation using stack. In this code first created node will be treated as root node. After that another function insert() will be called for adding the child nodes. Every time one node created and sent to stack for keeping track of that node. …
Binary Tree Creation using Queue code This code is for Binary tree creation using queue. In this code first created node will be treated as root node. After that another function insert() will be called for adding the child nodes. Every time one node created and sent to queue for keeping track of that node. …
Doubly Linked List Code This code is designed to implement Doubly Linked List concept. In this code almost all the possible operations are implemented using separate functions. Each function is designed to implement one accessibility technique of doubly linked list during insertion or deletion. Here we have designed two display functions for two different way …
