{"payload":{"header_redesign_enabled":false,"results":[{"id":"139184035","archived":false,"color":"#f34b7d","followers":11,"has_funding_file":true,"hl_name":"harismuneer/2-3-Tree","hl_trunc_description":"🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge…","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":139184035,"name":"2-3-Tree","owner_id":30947706,"owner_login":"harismuneer","updated_at":"2021-01-17T17:42:44.075Z","has_issues":true}},"sponsorable":false,"topics":["data-structures","tree-search","two-three-tree","balanced-trees","b-tree","balanced-search-trees","datastorage","2-3-tree","two-three-trees","tree-data-structure","open-source-code","free-to-use","tree-datastructures","split-operations","rotations-operations","datastructures-tasks","insert-delete-operations"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":71,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Aharismuneer%252F2-3-Tree%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/harismuneer/2-3-Tree/star":{"post":"xT8QG9bZv9WBmKp3FVgzI7KLqoz9-mJe45Wz7Ewe4SBaauXMEUaUFYb-DkiUn0u7EtHC7CwMzpoe4zjhPaS3yQ"},"/harismuneer/2-3-Tree/unstar":{"post":"-TGevcn1jcuBgLASho1wr64MnIJQxHP4tXRm-bE3BTuVOQNm0doI1rnV5T8cMBiAirXSxZfCfyzWY43a00H-uQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"DC9YaxcOdg2sU0HUi9rV8iedbsLm2pifQF9jqRqN39BJ9MBsB3e4vG7dIUcFoVjqS2ElOL5_MzavK-jL_bEE4Q"}}},"title":"Repository search results"}