Author: admin2

Minimum element in the Binary Search Tree is the left most element. Maximum element in the Binary Search Tree is the right most element. See below Working Process. Working Process for Min-Element Searching Here we are traversing the left sub-tree Read More …

For searching an specific data or element in BST is similar to Binary Search Algorithm. If searching data is less than the root , then we will go to left subtree for finding the required data , means we will Read More …

Deletion Operation of Binary Search Tree(BST) is something complex , because we are not going to only delete the specific element from Binary Search Tree(BST) but also we consider the correct arrangement of node after deletion operation. There are some Read More …

For inserting an element into a Binary Search Tree, first we have to look the exact location for that element. finding the location means where the new element will place in binary search tree.for searching the exact location, we will Read More …

Binary Search Tree(BST) Definition See the Example : Binary Search Tree Node Representation Operations of Binary Search Tree(BST) There are some basic operation ,which can apply on the BST :

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 …