In the previous chapter we have seen the implementation of Circular Queue using arrays. In this chapter we shall see how to implement Circular Queue using Circular Singly Linked List. As we are using circular singly linked list, there is no need to compute the index …

In previous chapter we have seen how to implement queue using arrays. In this chapter we shall see how to implement queue using linked list . One major implementation difference here is that, instead of taking taking 2 pointers like “rear” and “front”, using LL we …

What is a Queue? A queue is a data structure where the elements are inserted from one end and are deleted from the other end. The place where the elements are inserted is called as rear end, and the place where the elements are deleted is …

In the first chapter of Linked List we learnt about Singly Linked List. In this chapter we shall learn about circular singly linked list. The only addition is, the last node next pointer will point to the head node, hence making it circular Linked List. Below …

In the previous chapter we learnt about single linked list. In this chapter we shall learn about Doubly Linked List. Doubly Linked List is a special data structure, which is a collection of zero or more nodes. Each node is made up of 3 parts, “prev_link …

Singly Linked list is a special data structure, which is a collection of zero or more nodes. The node is a combination of data + link. Data: It is used to store some value. It can be an Integer variable or a structure. Link: It is …

In the previous chapter we have seen introduction to stack and it’s implementation using Arrays. In this chapter we shall see how to implement stack using Linked List. As till now we have not used LL, below are some Linked List Basics: In the next chapters …