Another quick and dirty algorithm implementation in C++. This time a Binary search tree (no balancing):<\/p>\n
\r\n\r\n#include <iostream>\r\n#include <vector>\r\n\r\nusing namespace std;\r\n\r\nclass Node {\r\n\r\npublic:\r\n\r\n int value;\r\n\r\n Node *less;\r\n Node *more;\r\n};\r\n\r\nclass BinarySearchTree {\r\n\r\npublic:\r\n\r\n BinarySearchTree() : root(NULL) {}\r\n\r\n void find_node(int value,Node **findnode,Node **parent) {\r\n\r\n *findnode = NULL;\r\n *parent = NULL;\r\n\r\n if(root == NULL) {\r\n return;\r\n }\r\n\r\n Node *current = root;\r\n for(;;) {\r\n if(current->value == value) {*findnode = current; return;}\r\n\r\n if(value < current->value) {\r\n if(current->less != NULL) {*parent = current; current = current->less;}\r\n else {\r\n return;\r\n }\r\n } else {\r\n if(current->more != NULL) {*parent = current; current = current->more;}\r\n else {\r\n return;\r\n }\r\n }\r\n }\r\n }\r\n \r\n Node *getr(Node *c,Node **parent) {\r\n *parent = c;\r\n for(;c->more != NULL;) {\r\n *parent = c;\r\n c = c->more;\r\n }\r\n return c;\r\n }\r\n\r\n void remove(int value) {\r\n \r\n Node *delnode;\r\n Node *parent;\r\n\r\n find_node(value,&delnode,&parent);\r\n\r\n if(delnode == NULL) return;\r\n\r\n \/\/ leaf\r\n if((delnode->less == NULL) && (delnode->more == NULL)) {\r\n if(parent->less == delnode) {parent->less = NULL;}\r\n if(parent->more == delnode) {parent->more = NULL;}\r\n delete delnode;\r\n return;\r\n }\r\n\r\n \/\/ only one child\r\n if((delnode->less == NULL) || (delnode->more == NULL)) {\r\n if(delnode->less != NULL) {\r\n if(parent->less == delnode) {parent->less = delnode->less;}\r\n if(parent->more == delnode) {parent->more = delnode->less;}\r\n delete delnode; \r\n return;\r\n }\r\n\r\n if(delnode->more != NULL) {\r\n if(parent->less == delnode) {parent->less = delnode->more;}\r\n if(parent->more == delnode) {parent->more = delnode->more;}\r\n delete delnode;\r\n return;\r\n }\r\n }\r\n\r\n \/\/ two children\r\n Node *i = getr(delnode->less,&parent);\r\n\r\n delnode->value = i->value;\r\n if(parent == i) { delnode->less = NULL;}\r\n if(parent->less == i) { parent->less = NULL; }\r\n else { parent->more = NULL; }\r\n delete i;\r\n }\r\n\r\n void insert(int value) {\r\n\r\n if(root == NULL) {\r\n Node *n = new Node();\r\n n->value = value;\r\n n->less = NULL;\r\n n->more = NULL;\r\n root = n;\r\n\r\n return;\r\n }\r\n\r\n Node *current = root;\r\n for(;;) {\r\n if(value < current->value) {\r\n if(current->less != NULL) current = current->less;\r\n else {\r\n Node *n = new Node();\r\n n->value = value;\r\n n->less = NULL;\r\n n->more = NULL;\r\n current->less = n;\r\n break;\r\n }\r\n } else {\r\n if(current->more != NULL) current = current->more;\r\n else {\r\n Node *n = new Node();\r\n n->value = value;\r\n n->less = NULL;\r\n n->more = NULL;\r\n current->more = n;\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n bool exists(int value) {\r\n if(root == NULL) {\r\n return false;\r\n }\r\n\r\n Node *current = root;\r\n for(;;) {\r\n if(current->value == value) return true;\r\n\r\n if(value < current->value) {\r\n if(current->less != NULL) current = current->less;\r\n else {\r\n return false;\r\n }\r\n } else {\r\n if(current->more != NULL) current = current->more;\r\n else {\r\n return false;\r\n }\r\n }\r\n }\r\n }\r\n\r\n Node *root;\r\n};\r\n\r\nint main() {\r\n\r\n BinarySearchTree s;\r\n\r\n vector<int> testdata;\r\n\r\n for(size_t n=0;n<10;n++) { testdata.push_back(rand()%20); }\r\n\r\n for(size_t n=0;n<10;n++) { s.insert(testdata[n]); }\r\n\r\n cout << "testdata: " << endl;\r\n for(size_t n=0;n<10;n++) { cout << testdata[n] << endl; }\r\n\r\n cout << "existance check: " << endl;\r\n for(size_t n=0;n<10;n++) { if(s.exists(testdata[n])) cout << "existance: " << testdata[n] << " true" << endl; else cout << "existance: " << testdata[n] << " false" << endl;}\r\n for(size_t n=0;n<10;n++) { if(s.exists(testdata[n]+20)) cout << "existance: " << testdata[n]+20 << " true" << endl; else cout << "existance: " << testdata[n]+20 << " false" << endl;}\r\n\r\n cout << "remove: " << testdata[5] << endl;\r\n s.remove(testdata[5]);\r\n if(s.exists(testdata[5])) cout << testdata[5] << " still exists" << endl; else cout << testdata[5] << " no longer exists" << endl;\r\n\r\n cout << "remove: " << testdata[3] << endl;\r\n s.remove(testdata[3]);\r\n if(s.exists(testdata[3])) cout << testdata[3] << " still exists" << endl; else cout << testdata[3] << " no longer exists" << endl;\r\n\r\n cout << "remove: " << testdata[0] << endl;\r\n s.remove(testdata[0]);\r\n if(s.exists(testdata[0])) cout << testdata[0] << " still exists" << endl; else cout << testdata[0] << " no longer exists" << endl;\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Another quick and dirty algorithm implementation in C++. This time a Binary search tree (no balancing): #include <iostream> #include <vector> using namespace std; class Node { public: int value; Node *less; Node *more; }; class BinarySearchTree { public: BinarySearchTree() : root(NULL) {} void find_node(int value,Node **findnode,Node **parent) { *findnode = NULL; *parent = NULL; if(root […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[1],"tags":[],"class_list":["post-837","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p1RRoU-dv","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts\/837","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/comments?post=837"}],"version-history":[{"count":1,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts\/837\/revisions"}],"predecessor-version":[{"id":838,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts\/837\/revisions\/838"}],"wp:attachment":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/media?parent=837"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/categories?post=837"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/tags?post=837"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}