{"payload":{"header_redesign_enabled":false,"results":[{"id":"576101055","archived":false,"color":"#f34b7d","followers":2,"has_funding_file":false,"hl_name":"BrianVianaC7/Balanced-tree-maximum-heap","hl_trunc_description":"Built a maximum heap program of a balanced tree, using recursion for the heap, both to added new elements to the tree and eliminate eleme…","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":576101055,"name":"Balanced-tree-maximum-heap","owner_id":120147778,"owner_login":"BrianVianaC7","updated_at":"2023-03-12T03:49:53.617Z","has_issues":true}},"sponsorable":false,"topics":["cpp","vector","recursive-functions","heap","maximum","recursivity"],"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":52,"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%253ABrianVianaC7%252FBalanced-tree-maximum-heap%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/BrianVianaC7/Balanced-tree-maximum-heap/star":{"post":"HSBI_v0JcSBv22njK4YucpAwbpHX_QzLbGNU80R3Szosmh2YHcGBeoH97adJFOSE1Y03RP2At2uv4aLmNm1ivg"},"/BrianVianaC7/Balanced-tree-maximum-heap/unstar":{"post":"bln0Z1NQPFGwa0K5FL4UlUeuNp40WCq9TfXa7EAor6k6A3lmFxxEwZ6pfE1Fbarfljcqg7SZbTyGDtS2nU6I2A"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"D4ErJcCCmNcQnA4SwW0yhtfJ9vyEcoKo6DXAiB2Qq1ep1spB6WAddL7EPOQQkrEp-dL1rpJQ--IzesXuFmXbqA"}}},"title":"Repository search results"}