{"id":22513655,"url":"https://github.com/emahtab/morris-inorder-traversal","last_synced_at":"2026-01-07T14:05:30.130Z","repository":{"id":79525667,"uuid":"238993618","full_name":"eMahtab/morris-inorder-traversal","owner":"eMahtab","description":"Morris Inorder Traversal of a Binary Tree","archived":false,"fork":false,"pushed_at":"2020-02-07T18:31:29.000Z","size":6,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-28T01:31:00.895Z","etag":null,"topics":["binary-tree","inorder-traversal","leetcode","morris-traversal","problem-solving"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/eMahtab.png","metadata":{},"created_at":"2020-02-07T18:08:59.000Z","updated_at":"2020-02-07T18:31:31.000Z","dependencies_parsed_at":"2023-05-10T17:30:29.066Z","dependency_job_id":null,"html_url":"https://github.com/eMahtab/morris-inorder-traversal","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/eMahtab/morris-inorder-traversal","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmorris-inorder-traversal","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmorris-inorder-traversal/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmorris-inorder-traversal/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmorris-inorder-traversal/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/eMahtab","download_url":"https://codeload.github.com/eMahtab/morris-inorder-traversal/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmorris-inorder-traversal/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28235811,"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","status":"online","status_checked_at":"2026-01-07T02:00:05.975Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["binary-tree","inorder-traversal","leetcode","morris-traversal","problem-solving"],"created_at":"2024-12-07T03:13:55.538Z","updated_at":"2026-01-07T14:05:30.126Z","avatar_url":"https://github.com/eMahtab.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Femahtab%2Fmorris-inorder-traversal","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Femahtab%2Fmorris-inorder-traversal","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Femahtab%2Fmorris-inorder-traversal/lists"}