# D.S & Algorithm

## Binary Search Tree(BST)

Binary Search Tree(BST)  Binary search tree is either empty or satisfy rules. The value of a key in a left child or left subtree is less than the value of root. The value of a key in the right child or right subtree is greater than the value of the root. Creation of Binary Tree …

## How to traverse through a binary tree

There are three methods for graph use traversing. How to use IN-ORDER TRAVERSAL? IN-ORDER TRAVERSAL L D R Traverse the left subtree in Inorder Traversal Process(visit) the Data node(root) Traverse the Right subtree in Inorder Traversal Step-1: Start from node L, which means left of each node until the data not found, when we reached node A visit …

## Data Structure – Trees

When you read the word Tree. What becomes in your mind first? Ans. We can say that firstly root and stems become in our mind. Similarly, Trees in Data structure. Which have one route node (like the root of the tree) and many different node belongs to that rote node (like stems of the tree). Structure …

Scroll to Top