{"id":48213821,"url":"https://github.com/pashaproton/binary-tree","last_synced_at":"2026-04-04T18:54:22.432Z","repository":{"id":193983823,"uuid":"689859609","full_name":"pashaproton/binary-tree","owner":"pashaproton","description":"Example of the binary tree in different languages","archived":false,"fork":false,"pushed_at":"2023-09-12T06:12:42.000Z","size":7,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-12-16T15:56:08.629Z","etag":null,"topics":["algorithms","binary-tree","c","cpp","education","example","javascript","php","python"],"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/pashaproton.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-09-11T04:01:45.000Z","updated_at":"2023-09-12T06:14:57.000Z","dependencies_parsed_at":"2023-09-11T05:22:12.175Z","dependency_job_id":"d1a8c0b0-ec78-44cd-aadd-4bcfd2c7187e","html_url":"https://github.com/pashaproton/binary-tree","commit_stats":{"total_commits":5,"total_committers":1,"mean_commits":5.0,"dds":0.0,"last_synced_commit":"96f5d88d5392acf7677354a3d46f1462a6bcd98e"},"previous_names":["pashaproton/binary-tree"],"tags_count":0,"template":null,"template_full_name":null,"purl":"pkg:github/pashaproton/binary-tree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pashaproton%2Fbinary-tree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pashaproton%2Fbinary-tree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pashaproton%2Fbinary-tree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pashaproton%2Fbinary-tree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pashaproton","download_url":"https://codeload.github.com/pashaproton/binary-tree/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pashaproton%2Fbinary-tree/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31409470,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-04T10:20:44.708Z","status":"ssl_error","status_checked_at":"2026-04-04T10:20:06.846Z","response_time":60,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","binary-tree","c","cpp","education","example","javascript","php","python"],"created_at":"2026-04-04T18:54:20.565Z","updated_at":"2026-04-04T18:54:22.403Z","avatar_url":"https://github.com/pashaproton.png","language":null,"readme":"# Binary Tree\n\nThere are examples in different languages of binary tree implementation.\n\n[C](./examples/C/binary-tree.c)\n| [C++](./examples/C++/binary-tree.cpp)\n| [PHP](./examples/PHP/binary-tree.php)\n| [Python](./examples/Python/binary-tree.py)\n| [JavaScript](./examples/JavaScript/binary-tree.js)\n\n---\n\nEach implementation contains next functions or methods depends on language paradigm:\n- **Depth first values** - explore the nodes of the tree, starting from a root node, and it returns a list of node values in the order they were visited.\n- **Breath first Values** - visiting all root immediate children before moving on to their children, and so on.\n- **Tree Includes** - checks whether a given value exists within a binary tree.\n- **Tree Sum** - The \"Tree Sum\" function calculates the sum of all the values stored in the nodes of a binary tree.\n- **Tree Min Value** - finds the minimum value.\n- **Max Root to Leaf Path Sum** - calculates the maximum sum that can be obtained by following a path from the root node to any leaf node in a binary tree.\n\n---\n\n### Examples\nEach example has **run.sh** file which can be run by `sh run.sh` command. Files structure and names are the same for every language, difference in implementation only.\n\n### Contributing and Issues\n- If you see a bug in the code please add new issue [bugs](https://github.com/pashaproton/binary-tree/issues/new) with label **bug**.\n- Do not hesisate [add new ideas](https://github.com/pashaproton/binary-tree/issues/new) with label **proposal**.\n- Feel free fork the project or add new ideas.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpashaproton%2Fbinary-tree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpashaproton%2Fbinary-tree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpashaproton%2Fbinary-tree/lists"}