{"request":{"endpoint":"https://exercism.org/api/v2/tracks/cpp/exercises/binary-search-tree/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"d029d793ff4e4488bf7b5a7948921453","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":63,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-08T20:41:51.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"mdipta"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/mdipta","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"914001c617df4bdca7cedd83086a0de1","snippet":"namespace binary_search_tree { template class binary_tree { private: tree_ptr _left = nullptr; tree_ptr _right = nullptr; tree_t* _parent = nullptr; T _data{}; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":3,"num_loc":106,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-18T16:08:24.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"emiller42"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/emiller42","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"2afbe9e07f1e45eaa7ddc92d734ac7a6","snippet":"namespace binary_search_tree { template class binary_tree { public: binary_tree() {} binary_tree(const T& data) : data_(data) {} binary_tree(const T& data, binary_tree* parent) : data_(data), parent_(parent) {} ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":4,"num_loc":76,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-09-12T05:50:02.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"acjensen"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/acjensen","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"a9313594621447b98701c6e8cc4d5f9b","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":63,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-04T19:47:02.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"praneethkumarjinukala"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/praneethkumarjinukala","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"229f689c1bc242f292b7bc8ad475e91a","snippet":"namespace binary_search_tree { template class binary_tree { public: binary_tree(T data, binary_tree *parent = nullptr) : data_(data), left_(nullptr), right_(nullptr), parent_(parent){}; ~binary_tree(){}; T &data() { return data_; }; std::unique_ptr> &left() { return left_; }; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":66,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-08-14T08:54:32.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"dadep88"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/dadep88","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"fd4cc8a943664e02b80214cc20a70ea3","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":6,"num_loc":81,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-19T07:00:16.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"studentenherz"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/studentenherz","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"760322199ff64f2292a11057a53f6aee","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":66,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-22T03:28:36.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"paxmix"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/paxmix","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"7b1ca7534b0f476e8d93e453015ded6f","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":133,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-10T11:54:49.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Dipendu"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/Dipendu","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"ff31d51809aa407fae96e40f7860ad52","snippet":"namespace binary_search_tree { template class binary_tree{ public: binary_tree(const T data) : dataV{data}{} const std::unique_ptr>& left() {return leftNode;} const std::unique_ptr>& right() {return rightNode;} const T& data() const{ return dataV; } void insert(T data); ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":77,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-31T05:32:40.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Kintarooe"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/Kintarooe","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"bc22c0230b9b4da68e69b472bbe53400","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":134,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-06T15:44:29.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"partiellkorrekt"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/partiellkorrekt","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"deb14f03e2ea443eb08861365e2f0639","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":85,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-30T16:23:54.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"muimi"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/muimi","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"2df15454be5e479798cb61b4d38e33ce","snippet":"","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":66,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-13T17:58:15.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"tomasalarcon10"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/tomasalarcon10","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"01cdc9b9411643a19939db2f56eccb5c","snippet":"namespace binary_search_tree { template class binary_tree { T m; std::unique_ptr> m_left; std::unique_ptr> m_right; std::vector sorted_values; public: binary_tree(const T& t) : m(t), m_left(nullptr), m_right(nullptr) {} ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":63,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-06-30T00:56:28.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"nullopen"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/nullopen","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"4f646a3ab3734e5a89038df2ffac4295","snippet":"namespace binary_search_tree { template class binary_tree { public: binary_tree(T data) : mData(data) {}; void insert(T data) { if(data <= mData) { if (mLeft) mLeft->insert(data); else mLeft = std::make_unique(data); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":45,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-01T05:13:34.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"talimavale"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/talimavale","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"7b23d7237cfb4b9d98d702daf0e3229d","snippet":"namespace binary_search_tree { template binary_tree::binary_tree(T Tp) : _data(Tp), _parent(nullptr), _left(nullptr), _right(nullptr) {} template binary_tree::binary_tree(T Tp, binary_tree *node) : _data(Tp), _parent(node), _left(nullptr), _right(nullptr) {} ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":5,"num_loc":98,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-10T18:04:15.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Lukeekul"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/Lukeekul","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"606e0bca777f455193f13c472897ba60","snippet":"namespace binary_search_tree { template class binary_tree { private: T data_; std::unique_ptr> left_, right_; public: binary_tree(T data) : data_(data) {} ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":52,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-29T02:21:37.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"JDygert"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/JDygert","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"ce61547f4022485c8a8852a73e47196c","snippet":"namespace binary_search_tree { template class binary_tree_node; template class binary_tree_iterator { public: binary_tree_iterator(node_ptr ptr, bool is_end_it = false); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":101,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-15T01:12:27.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Nikko77"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/Nikko77","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"3d3daee7558942738943f7958ea9a1b2","snippet":"namespace binary_search_tree { template class binary_tree { private: T _data; size_t left_nodes = 0, right_nodes = 0; std::unique_ptr _left, _right; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":9,"num_loc":60,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-02-09T05:38:37.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"joemoore94"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/joemoore94","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"f98854f938f34fb6ac64f24cabdfa380","snippet":"namespace binary_search_tree { template class binary_tree { private: T m_data; binary_tree *root, *parent; std::unique_ptr> m_left, m_right; public: struct tree_iterator { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":88,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-06-22T19:30:50.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"gustavobrossi"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/gustavobrossi","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"2634501cfac54a7f9d946a0e00861ca9","snippet":"namespace binary_search_tree { template class binary_tree; template template class binary_tree { public: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":94,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-12T08:02:26.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"lebakasama"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/lebakasama","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"9e253cff0793495d9a7504a858bb6514","snippet":"namespace binary_search_tree { template class binary_tree { private: T m_data; std::unique_ptr m_left; std::unique_ptr m_right; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":7,"num_loc":72,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-26T09:43:19.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"mtmk"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/mtmk","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"5316abaf8e9a40c49935e4457559b36f","snippet":"namespace binary_search_tree { }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":135,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-20T21:46:21.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"gradnerj"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/gradnerj","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"927048acf3cd4bfd8efa849a9cd1585b","snippet":"namespace binary_search_tree { template class binary_tree{ public: struct iter{ pointer tp{nullptr}; T val = T(); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":105,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-02T19:50:08.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"ones-and-zeros"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/ones-and-zeros","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}},{"uuid":"c3c5fb4240184f1d907357aae379c99b","snippet":"namespace binary_search_tree { } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":81,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-26T09:27:02.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"HarryCoder"},"exercise":{"title":"Δυαδικό Δέντρο Αναζήτησης","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/solutions/HarryCoder","private_iterations_url":"https://exercism.org/el/tracks/cpp/exercises/binary-search-tree/iterations"}}],"meta":{"current_page":1,"total_count":246,"total_pages":11,"unscoped_total":246}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders