binarysearchtreeindatastructures-200604055006 (1).pdf
- 1. Introduction A binary search tree is a useful data structure for fast addition and removal of data. It is composed of nodes, which stores data and also links to upto two other child nodes. It is the relationship between the leaves linked to and the linking leaf, also known as the parent node, which makes the binary tree such an efficient data structure.
- 2. Cont… For a binary tree to be a binary search tree, the data of all the nodes in the left sub-tree of the root node should be less than the data of the root. The data of all the nodes in the right subtree of the root node should be greater than equal to the data of the root. As a result, the leaves on the farthest left of the tree have the lowest values, whereas the leaves on the right of the tree have the greatest values.
- 4. Insertion in a BST To insert data into a binary tree involves a function searching for an unused node in the proper position in the tree in which to insert the key value. The insert function is generally a recursive function that continues moving down the levels of a binary tree until there is an unused leaf in a position which follows the following rules of placing nodes.
- 5. Cont.. Compare data of the root node and element to be inserted. If the data of the root node is greater, and if a left subtree exists, then repeat step 1 with root = root of left subtree. Else, Insert element as left child of current root.
- 6. Cont.. If the data of the root node is greater, and if a right subtree exists, then repeat step 1 with root = root of right subtree. Else, insert element as right child of current root.
- 8. Assignment Explain Binary Search Tree in data structure with suitable example and discuss basic operation.