{"payload":{"header_redesign_enabled":false,"results":[{"id":"70343200","archived":false,"color":"#b07219","followers":0,"has_funding_file":false,"hl_name":"hdjtdxwt/BinaryTree","hl_trunc_description":"二叉树Tree的树结构，以及实现三种遍历（递归和非递归方式），求树的深度等","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":70343200,"name":"BinaryTree","owner_id":9925332,"owner_login":"hdjtdxwt","updated_at":"2016-10-08T16:22:17.878Z","has_issues":true}},"sponsorable":false,"topics":[],"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":91,"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%253Ahdjtdxwt%252FBinaryTree%2B%2Blanguage%253AJava","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/hdjtdxwt/BinaryTree/star":{"post":"56rTYo-tg-6rnu8NRJD4XMZa97ley5Gsc8J1RrJfi0BBuir8Fz9b0GkGVEyVMp1CTTOB4LpCGaRogX9Gp9F7zg"},"/hdjtdxwt/BinaryTree/unstar":{"post":"npw1PgU5ec6VQ_M-H87H7DgkHk-x92D8ytEFDOnB7rLVp8aXyblPAljWxgXaPq05AGnTwIGEgbADWPEHWiRV1Q"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"ccT5nemgXvLugO2A4ywjE1qseEOuIH3Z_60qtd2n01ArxH4yFJEatm5XriaoWVy6jZoYVZ4E9cNeO-pHuiNp7A"}}},"title":"Repository search results"}