/ Published in: C++
URL: http://en.wikipedia.org/wiki/Binary_search_tree
This is about binary search
Expand |
Embed | Plain Text
bool BinarySearchTree::search(int val) { Node *next = this->root(); while (next != NULL) { // PREORDER if (val == next->value()) { return true; } // POSTORDER else if (val < next->value()) { next = next->left(); } // IN-ORDER else { next = next->right(); } } //not found return false; }
You need to login to post a comment.
