{"id":19449603,"url":"https://github.com/nihadamirov/holbertonschool-binary_trees","last_synced_at":"2026-06-18T00:31:15.199Z","repository":{"id":232388992,"uuid":"783800475","full_name":"nihadamirov/holbertonschool-binary_trees","owner":"nihadamirov","description":"Binary tree data structure and algorithms project completed for Holberton School","archived":false,"fork":false,"pushed_at":"2024-04-22T14:40:32.000Z","size":30,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-25T09:19:28.749Z","etag":null,"topics":["binary-tree","binary-tree-preorder","binary-tree-search","binary-tree-traversal","c-data-structures-and-algorithms","data-structures-and-algorithms"],"latest_commit_sha":null,"homepage":"","language":"C","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/nihadamirov.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-04-08T15:41:15.000Z","updated_at":"2024-07-19T19:25:21.000Z","dependencies_parsed_at":"2024-04-21T21:35:44.963Z","dependency_job_id":"51ff8ffd-39f2-4558-bcc6-c125f27d3d75","html_url":"https://github.com/nihadamirov/holbertonschool-binary_trees","commit_stats":null,"previous_names":["nihadamirov/holbertonschool-binary_trees"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nihadamirov/holbertonschool-binary_trees","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nihadamirov%2Fholbertonschool-binary_trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nihadamirov%2Fholbertonschool-binary_trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nihadamirov%2Fholbertonschool-binary_trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nihadamirov%2Fholbertonschool-binary_trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nihadamirov","download_url":"https://codeload.github.com/nihadamirov/holbertonschool-binary_trees/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nihadamirov%2Fholbertonschool-binary_trees/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34471638,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-17T02:00:05.408Z","response_time":127,"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","binary-tree-preorder","binary-tree-search","binary-tree-traversal","c-data-structures-and-algorithms","data-structures-and-algorithms"],"created_at":"2024-11-10T16:33:05.964Z","updated_at":"2026-06-18T00:31:15.182Z","avatar_url":"https://github.com/nihadamirov.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# \u003ca\u003e \u003cimg src=\"https://upload.wikimedia.org/wikipedia/commons/thumb/1/18/C_Programming_Language.svg/1200px-C_Programming_Language.svg.png\" width=3% heigth=3% \u003e\u003c/img\u003e\u003c/a\u003e  Binary Trees\n\n\n## Learning Objectives\n- What is a binary tree\n- What is the difference between a binary tree and a Binary Search Tree\n- What is the possible gain in terms of time complexity compared to linked lists\n- What are the depth, the height, the size of a binary tree\n- What are the different traversal methods to go through a binary tree\n- What is a complete, a full, a perfect, a balanced binary tree\n## Requirements\n- Allowed editors: `vi`, `vim`, `emacs`\n- All your files will be compiled on Ubuntu 20.04 LTS using gcc, using the options `-Wall -Werror -Wextra -pedantic -std=gnu89`\n- The prototypes of all your functions should be included in your header file called `binary_trees.h`\n## Functions\n- **binary_tree_node**, creates a binary tree node\n- **binary_tree_insert_left**, function that inserts a node as the left-child of another node\n- **binary_tree_insert_right**, function that inserts a node as the right-child of another node\n- **binary_tree_delete**, function that deletes an entire binary tree\n- **binary_tree_is_leaf**, function that checks if a node is a leaf\n- **binary_tree_is_root**, function that checks if a given node is a root\n- **binary_tree_preorder**,  function that goes through a binary tree using pre-order traversal\n- **binary_tree_inorder**,  function that goes through a binary tree using in-order traversal\n- **binary_tree_postorder**, function that goes through a binary tree using post-order traversal\n- **binary_tree_height**,  function that measures the height of a binary tree\n- **binary_tree_depth**, function that measures the depth of a node in a binary tree\n- **binary_tree_size**, function that measures the size of a binary tree\n- **binary_tree_leaves**, function that counts the leaves in a binary tree\n- **binary_tree_nodes**,  function that counts the nodes with at least 1 child in a binary tree\n- **binary_tree_balance**, function that measures the balance factor of a binary tree\n- **binary_tree_is_full**, function that checks if a binary tree is full\n- **binary_tree_is_perfect**, function that checks if a binary tree is perfect\n- **binary_tree_sibling**, function that finds the sibling of a node\n- **binary_tree_uncle**, function that finds the uncle of a node\n\n---\n\n## 👥 Team\n👨‍💻 Nihad Amirov [nihadamirov](https://github.com/nihadamirov)\n\n👨‍💻 Rafig Mammadov  [rafigmammadov](https://github.com/rafigmammadov)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnihadamirov%2Fholbertonschool-binary_trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnihadamirov%2Fholbertonschool-binary_trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnihadamirov%2Fholbertonschool-binary_trees/lists"}