In Data Structure a Heap is a Binary tree in which all levels have a maximum number of nodes except possibly the last level and in the last level all the nodes are to the left and the key in any node is greater than or equal to the keys in both children of the…
While performing deletion operation in a binary search tree we come to three cases. the node that we want to delete let’s see them one by one with the help of an example Node has no child For deleting a node that doesn’t have any child then we replace the linked part of the node’s…
To perform the Insertion operation in a binary search tree we need to follow some conditions because in the binary search tree, the left node has a value less than the root node and the right node has a value greater than the root node. Suppose we want to insert a new key X in the binary…
The binary search tree is a tree in which all the values in the left subtree are less than the value of the root node and values of the right subtree are greater than the value of the root node. as you see in the above example the left subtree has values lesser than the…
In level order traversal of Binary Tree, we visit each node of the tree level by level. let’s say we have a tree as you see in the image given below. here in the tree, there are 4 levels. So to find the level order of this tree we visit each level from top to…
In postorder traversal of a binary tree, we first traverse the left subtree of the root node and then the right subtree of the root node, and then we traverse the root node of the binary tree. Properties of postorder traversing let’s say we have a binary tree as you see in the image given…
In the Preorder traversal of a Binary Tree, we first visit the root node of the tree then the left subtree, and then the right subtree of the root node. Properties of Preorder Traversal let’s say we have a binary tree as you see in the given below image. to find the preorder of this…
In the Inorder traversal of the binary tree, we first visit the left subtree of the root node, and then we visit the root node and after that, we visit the right subtree of the root node. Properties of Inorder traversal let’s understand it with an example let’s say we have a binary tree as you see…
Traversing a binary tree means visiting each node of the tree exactly once. and as we know the nodes of the tree are arranged in a hierarchical order so there are different ways to traverse a binary tree. we have three main tasks to traverse in the tree. Types of traversing in a binary tree….
For the linked representation of a binary tree, we use a node that has three parts. in the first part, we store the reference of the left child of the node in the right part, we store the reference of the right child and in the middle part, we store the value of the node….
