5 - Binary Search Tree - 2101667405 - Evania Joycelin A.
1. Operations: Search, Insertion, Deletion a. Searching for a Node in a Binary Search Tree The search function is used to find whether a given value is present in the tree or not. The searching process begins at the root node. The function first checks if the binary search tree is empty. If it is empty, then the value we are searching for is not present in the tree. If there are nodes in the tree, then the search function checks to see if the key value of the current node is equal to the value to be searched. If not, it checks if the value to be searched for is less than the value of the current node, go to left child node. In case the value is greater than the value of the current node, go to right child node. Consider we want to search 12 Consider we want to search 67 struct node* search (struct node *curr, int X) { if ( curr == NULL ) return NULL; // X is found if ( X == curr-...
