Java Tutorials with Internals

In the collection framework, stack comes with the extended functionalities of Vector class. There are 5 functionalities in the stack class which are the extension of vector class functionalities. There are 2 different ways to implement stack -  Using Array Using ArrayList 1. Using Array : Array is the basic memory for any implementation in java. We will see how to implement it using array. To build custom stack, please follow below steps: Declare StackArray class and it's constructor: Below image depicts that the above piece of code registers the two indexes space in memory and points to idx at 0 position: Now add the method of push and pop to the class which will take care of addition and removal of element to the stack: Our basic functionality of stack is ready. Now we will add the support functions to it: These size and print methods will help us while running the program to get the current status of the stack. Now have few methods to opt...

Stack Framework In the list of data structures, the next name is "Stack". In the collection framework, stack comes with the extended functionalities of Vector class.  It is the one which works on LIFO(Last in, first out) principle i.e. the element which inserted at last would be eligible to come out first and so on. e.g. if 1,2,3,4,5 inserted in a stack, the order to get the elements from it must be 5,4,3,2,1 As shown in the above figures, the stack is like cylinder and the data is like cylinder size disks. If the disks put in the cylinder and we need to take out the first disk out of it, we must take out all the disks which are above it, then only we would be able to get our disk. It extends Vector class and implement five operations to behave like stack.  Operations of Stack Stack supports the push and pop operations. Let's look at the details: 1. Push() : The push operation can be defined as putting the disk or element ...

The doubly linked list is same as the linked list but every node has address of previous node also along with next node so that the traversal can be done in both ways. To implement the custom doubly linkedlist, please follow below steps: 1. Create the basic structure class 2. Implement the doubly linkedlist operations 3. Test the functionality Full implementation source code is as below: Output: 23->34->65->78 -1->23->34->3478->65->78->6445 -1->23->34->3478->65->78 -1->23->34->3478->65 65->3478->34->23->-1 Prev::3478 & Curr::65 Look at my other posts: Stack in Java Custom Stack Implementation Set Interface in Java Custom Doubly LinkedList Implementation Custom LinkedList Implementation How to fetch elements from LinkedList List Traversal How to insert elements in List How to remove element from list How to declare Linked List and Implement LinkedList Traversal In Reverse Sequential Order Array...

The Linkedlist represents the chain of data nodes as list in java. The current node has the address or connection with the next node in single linked list and of previous node also in double linked list. To build custom linkedlist, please follow below 3 steps: 1. First, we need to construct the structure of linked list 2. Second, implement the operations of the linked list in another class 3. Third, test the functionality The source code of program Output: 12->454->89->1 12->454->1 45->12->454->1->23 abc->raj->kiran abc->raj 65->Gyan Look at my other posts: Stack in Java Custom Stack Implementation Set Interface in Java Custom Doubly LinkedList Implementation Custom LinkedList Implementation How to fetch elements from LinkedList List Traversal How to insert elements in List How to remove element from list How to declare Linked List and Implement LinkedList Traversal In Reverse Sequential Order ...