Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
// C function to search a given key in a given BST
struct node* search(struct node* root, int key)
// Base Cases: root is null or key is present at root
if (root == NULL || root->key == key)
return root;
// Key is greater than root's key
if (root->key < key)
return search(root->right, key);
// Key is smaller than root's key
return search(root->left, key);
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.