Queue is more abstract entity like stack than array and many other data structures. The underlying mechanism used to implement queues is not visible to the user. In queue first item inserted would be the first one to be removed… Read More!
In previous article Stack introduction and implementation we had learnt how to implement stack in java and in our first example Stack Example 1 we have seen how to use stack to reverse a word or a string. Stacks are commonly used… Read More!
In our previous article Stack Introduction and Implementation we had learnt how to implement stack in java. In this first example we will see how to reverse a word or a string using a stack. When you run the following code, it… Read More!
Stack is more abstract entity than array and many other data structures. The underlying mechanism used to implement stacks is not visible to the user. It follows Last In First Out (LIFO) principle i.e., stacks allows access to only one… Read More!
The following is the example code for an ordered array data structure. OrderedArrayDataStructure class encapsulate the array and its algorithms. We could have used binary search to find the position where we can insert element into the array. But for… Read More!
