{"id":98533,"date":"2021-07-22T09:00:14","date_gmt":"2021-07-22T03:30:14","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=98533"},"modified":"2021-07-20T14:06:35","modified_gmt":"2021-07-20T08:36:35","slug":"binary-search-tree","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/binary-search-tree\/","title":{"rendered":"Binary Search Tree Data Structure"},"content":{"rendered":"

As we discussed in the previous article, the binary search tree is one of the types of trees with some specific properties. A binary search tree is quick, efficient, and easy to implement. In this article, we will learn the working of a binary search tree, its properties, and its implementation.<\/p>\n

Binary search tree<\/h3>\n

BST, short for Binary search tree is a binary tree with specific following properties.<\/p>\n

1. The nodes in the left subtree must be less than the root node
\n2. The nodes in the right subtree must be greater than the root node.
\n3. The left and the right subtrees must also be binary trees.<\/p>\n

The above properties apply to each node of the binary tree for it to be a BST.<\/p>\n

\"Binary<\/a><\/p>\n

Operations on Binary Search Tree in data Structure<\/h3>\n

1. Searching in BST<\/h4>\n

Finding the location of an element in the BST<\/p>\n

Algorithm<\/h4>\n
search(root)\r\nIf root == NULL \r\n    return NULL;\r\nIf Value == root->data \r\n    return root->data;\r\nIf Value < root->data \r\n    return search(root->left)\r\nIf Value > root->data \r\n    return search(root->right)\r\n\r\n<\/pre>\n
2. Inserting element in BST<\/h4>\n
Inserting a new element in the BST<\/p>\n
Algorithm<\/h4>\n
createNode(newvalue)\r\nIf node == NULL \r\n    return createNode(newvalue)\r\nif (newvalue < node->data)\r\n    node->left  = insert(node->left, newvalue);\r\nelse if (newvalue > node->data)\r\n    node->right = insert(node->right, newvalue);  \r\nreturn node;\r\n<\/pre>\n
3. Deleting element from BST<\/h4>\n
deleting an existing element from BST<\/p>\n
Case 1<\/strong>: if a node is to be deleted from the Leaf node.<\/p>\n