In this Post, We will understand What is the difference between binary and binary search trees? Binary Tree Data Structure A tree is called a binary tree if each note has zero children, one child, or two children, an empty tree is also a valid binary tree. we can visualize a binary tree consisting of a… Read More »
In this post, we will learn How to write a java program to find a mirror image of a binary tree? To implement the algorithm to find the mirror image of a given binary tree in Java. A mirror image of a binary tree is another binary tree with left and right children of all… Read More »
In this post, we will learn How to write a java program to find the node with minimum and maximum values in a Binary Search Tree? If we want to find the node with minimum and maximum values in a binary search tree (BST) that is a very simple operation because of the way binary… Read More »
In this post, We will learn How to perform search operation in a binary search tree? The Search Operation in BST: If Tree is Empty then search key won’t find then return false If the key equals to root node that means key found then return true If the search key is less than the root… Read More »
In this post, We will learn How to perform delete operation in a binary search tree? The Delete Operation in BST: •First of all, We have to find the node we wish to delete (if it is there). • If we find that the node is a leaf then delete it. • If we find that… Read More »
In this post, We will learn How to perform insert operation in a binary search tree? The insert method: We insert an element at the place where we ‘fall off’ the tree looking for it. To insert key into Tree t: • If t is empty, replace t by a tree consisting of a single node… Read More »
This post talks about PostOrder traversal of binary tree implementation in Java In postOrder traversal, the root is visited after both left and right subtrees. PostOrder traversal is defined as follows: Traverse the Left Subtree Traverse the Right Subtree Visit the root PostOrder traversal can be implemented either recursive and iterative approach. Both Approaches have… Read More »
This post talks about InOrder traversal of binary tree implementation in Java In InOrder traversal, the root is visited between the subtrees InOrder traversal is defined as follows: Traverse the Left Subtree Visit the root Traverse the Right Subtree InOrder, traversal can be implemented either recursive and iterative approach. Both Approaches have shown below: Recursive… Read More »
This post talks about PreOrder traversal of binary tree implementation in Java This is the simplest traversal. In this traversal each node is processed before the subtrees, it still requires that some information must be maintained while moving down the tree. in the below picture, 1 then the left subtree, and this is followed by the… Read More »
Usually, the process of visiting all nodes of a tree is called tree traversal. Each node is processed only once but it may be visited more than once. Linear data structures like LinkedList, Stack or Queue, etc. The elements are visited in sequential order but in Tree structures, there are many different ways. Tree traversal… Read More »