AVL Tree In Data Structure?
AVL stands for Adelson-Vel’skii and Landis, These two were Russian mathematicians having the full names G.M. Adelson Vel’skii and E.M. Lan...
Data-Structure
47 posts
Tree: What is a tree in the data structure?
The tree(What is a tree in the data structure) is considered a most flexible, versatile, and powerful data structure that is used in representing the ...
What is compaction in memory management?
In this tutorial(What is compaction in memory management), I am going to explain one of the methods of dynamic memory management which is named compac...
What is garbage collection with an example?
Garbage collection is a method to detect and collect free nodes. The node that is in use and allocated is not detected whereas any no longer in use is...
What Is Dynamic Memory Management?
Dynamic memory management is the memory that is given instantly to a program variable or data structure when it is needed. Here we are explaining this...
Josephus problem & Circular linked list? / Josephus problem algorithm.
In this blog post(Josephus problem algorithm), I am going to discuss an interesting Josephus problem that you would have studied in the data structure...
What is a circular linked list?
A list with various numbers of the node containing data and address pointer and the list starts and finishes at the same first node is known as a circ...
What is the linked list in the data structure and their types?
A linked list is the collection of data elements or information in a linear fashion which is also known as nodes that are again linked to another node...
What is the priority queue with an example?
If we can insert and remove the element inside a queue at any position based on some specific or predefined priority then this type of queue is known ...
Stack vs Queue: the difference between stack and queue?
In this blog post(Stack vs Queue), I am going to let you know about the difference between stack and queue. As we know both are a non-primitive linear...