{"id":25171276,"url":"https://github.com/basemax/treetraversalsgo","last_synced_at":"2025-04-03T21:20:47.196Z","repository":{"id":151535631,"uuid":"579359533","full_name":"BaseMax/TreeTraversalsGo","owner":"BaseMax","description":"This is a simple Go program that traverses a tree in different ways. (Pre-order, In-order, Post-order, and Level-order)","archived":false,"fork":false,"pushed_at":"2022-12-19T16:25:36.000Z","size":28,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-28T17:08:12.635Z","etag":null,"topics":["data-structure","datastructure","ds","go","golang","tree","tree-search","tree-traversal","tree-traversal-algorithm","tree-traversal-algorithms","tree-traverse"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BaseMax.png","metadata":{},"created_at":"2022-12-17T12:38:52.000Z","updated_at":"2022-12-21T17:52:03.000Z","dependencies_parsed_at":"2023-07-10T14:15:46.722Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/TreeTraversalsGo","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTreeTraversalsGo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTreeTraversalsGo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTreeTraversalsGo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTreeTraversalsGo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/TreeTraversalsGo/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247079200,"owners_count":20880015,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["data-structure","datastructure","ds","go","golang","tree","tree-search","tree-traversal","tree-traversal-algorithm","tree-traversal-algorithms","tree-traverse"],"created_at":"2025-02-09T09:19:44.650Z","updated_at":"2025-04-03T21:20:47.191Z","avatar_url":"https://github.com/BaseMax.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Ftreetraversalsgo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Ftreetraversalsgo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Ftreetraversalsgo/lists"}