Author:

In Levelorder traversal,we have to follow the level of the tree,means first we have to traverse the level-0,then level-1 and so on. Process is defined as follows : process level-0 process the level-1 till last level Working Process of Postorde Read More …

In Postorder traversal, first we have to visit the left subtree ,then visit the right subtree and then root . Process is defined as follows : process the left subtree process the right subtree. Visit the root node. Working Process Read More …

In Inorder traversal, first we have to visit the left subtree ,then visit the root and then right subtree. Process is defined as follows : process the left subtree Visit the root node. process the right subtree. Working Process of Read More …

Traversal is a process to visit on every node at least once.Traversal process already discussed in Linked list ,Queue,Stack data structure where Traversing was sequential order.but in Binary tree we can traverse the all node by different different ways.for traversal, Read More …

1- Types of Binary Tree Binary Tree also have a lot of its category : 1.1 – Strict Binary Tree : If each node of a binary tree contain exactly two or zero children ,is called Strict binary tree. 1.2 Read More …

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 …