{"payload":{"header_redesign_enabled":false,"results":[{"id":"564778840","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"J-DHARANEESH/AVL-Tree-","hl_trunc_description":"avl tree is a type of binary search tree with an additional feature of self balancing factor and rotations. this code is been written in …","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":564778840,"name":"AVL-Tree-","owner_id":116566810,"owner_login":"J-DHARANEESH","updated_at":"2022-11-11T13:47:56.408Z","has_issues":true}},"sponsorable":false,"topics":["data-structures","tree-structure","avl-tree-node"],"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":105,"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%253AJ-DHARANEESH%252FAVL-Tree-%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/J-DHARANEESH/AVL-Tree-/star":{"post":"HdEv9KGeDJGVKa-l6Nv-DG_eqp1fyTacX05Er4OsfxNxAgUvufj0oJaSsqSM74-k6_Kvt1Z0qAL4infMquqYjw"},"/J-DHARANEESH/AVL-Tree-/unstar":{"post":"zalWFdwh6k4iqyzCuKxjxtSnMLWDx1J0OyQAndT7fPF5U5RJ6JpQmbdtX5sQ0YV5Ea9c3E543NxUV6uKdGnG4w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"I5v7kZ9G_UbS6PI-0eDoUlADAoWWJuXwHrIFKtsahKfTq8sNHzERda0az-ce2xo9GDFTBUEz3tBoRJHU0XUZPw"}}},"title":"Repository search results"}