Author: admin2

Tree data structure have a lot of it’s variations.there is some following types of tree : 1-Binary Tree 2-Binary Search Tree(BST) 3-AVL Tree 4-Red-Black Tree 5-N-Ary Tree 6-B Tree 7-B+ Tree

1-Buzzword of Tree There are some fundamentals properties of Tree, we have to know those properties because those will be use a lot at many places : 1.1-Child & Parent Node: A node which is containing the address of another Read More …

Push & Pop (Insertion & Deletion Operation) Working process of Push and Pop operations are following : Code Implementation Time & Space Complexity

Dynamic Array representation of Stack is better implementation of stack as compare to the simple array representation.In Dynamic Array representation,we can grow the stack size as per our requirements.Initially we can assign the array size=1 or more ,but when we Read More …

Simple Array Representation of Stack is very simple , but this is not an efficient and good representation of Stack,because Array size will be fixed. and we have to define this array size at beginning ,and we can not change Read More …

Similar to the Linked list and Queue ADT ,Stack is also use for storing the data.Stack is also an Sequential type data structure. Stack in Real Life Example of Push and Pop Operation Operations of Stack There are following some Read More …

We can implement the Queue in two ways :1-: Using HeadPointer Only (Not a good Approach,we will not discuss).2-: Using HeadPointer and TailPointer (Preferable Approach) 1- EnQueue & DeQueue(Insertion & Deletion Operation) Working process of EnQueue and DeQueue is following Read More …

Whats Problems in the Dynamic Array and Simple Circular Array Representation? In above figure Initial two spaces are empty be DeQueue operation,because first we filled the whole Queue,and then delete the two DataElements,So now rear is pointing to last index.and Read More …

Simple Circular Array Representation of Queue is extended version of Simple Array Representation of Queue , but this is also not an efficient and good representation of Queue,because Array size will be fixed. and we have to define this array Read More …

Dynamic Array Representation of Queue is better than Simple Array Representation , Dynamic Array Representation is something efficient and good representation of Queue,because Array size will be doubled when array size if full. we can say that Dynamic array representation Read More …