{"id":19341015,"url":"https://github.com/belovetech/binary_trees","last_synced_at":"2025-10-18T16:53:42.924Z","repository":{"id":111327854,"uuid":"527627538","full_name":"belovetech/binary_trees","owner":"belovetech","description":"The study of binary trees, which are non-primitive non-linear data structures, and how they differ from non-primitive linear data structures such as arrays, stacks, queues, and linked lists.","archived":false,"fork":false,"pushed_at":"2022-08-25T21:20:48.000Z","size":42,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-06T11:40:21.221Z","etag":null,"topics":["algorithms","binary-tree","c","data-structures"],"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/belovetech.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":"2022-08-22T15:39:05.000Z","updated_at":"2023-04-09T10:11:05.000Z","dependencies_parsed_at":"2023-05-23T13:46:18.652Z","dependency_job_id":null,"html_url":"https://github.com/belovetech/binary_trees","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/belovetech%2Fbinary_trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belovetech%2Fbinary_trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belovetech%2Fbinary_trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/belovetech%2Fbinary_trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/belovetech","download_url":"https://codeload.github.com/belovetech/binary_trees/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240444026,"owners_count":19802150,"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":["algorithms","binary-tree","c","data-structures"],"created_at":"2024-11-10T03:28:56.130Z","updated_at":"2025-10-18T16:53:37.891Z","avatar_url":"https://github.com/belovetech.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# binary_trees\n\nProject done during Full Stack Software Engineering studies at ALX Africa. It aims to learn about what is a binary tree, the different traversal methods to go through a binary tree (pre-order, in-order and post-order) and the different types of binary trees (complete, full, perfect and balanced).\n\n## Files in directory\n\n|Filename\t|Description|\n----------------------|---------------------------------------------------------------------|\n0-binary_tree_node.c|\tFunction that creates a binary tree node\n1-binary_tree_insert_left.c\t|Function that inserts a node as the left-child of another node\n2-binary_tree_insert_right.c|\tFunction that inserts a node as the right-child of another node\n3-binary_tree_delete.c|\tFunction that deletes an entire binary tree\n4-binary_tree_is_leaf.c\t|Funciton that checks if a node is a leaf\n5-binary_tree_is_root.c\t|Function that checks if a given node is a root\n6-binary_tree_preorder.c|\tFunction that goes through a binary tree using pre-order traversal\n7-binary_tree_inorder.c\t|Function that goes through a binary tree using in-order traversal\n8-binary_tree_postorder.c\t|Function that goes through a binary tree using post-order traversal\n9-binary_tree_height.c|\tFunction that measures the height of a binary tree\n10-binary_tree_depth.c\t|Function that measures the depth of a node in a binary tree\n11-binary_tree_size.c\t|Funciton that measures the size of a binary tree\n12-binary_tree_leaves.c\t|Function that counts the leaves in a binary tree\n13-binary_tree_nodes.c\t|Function that counts the nodes with at least 1 child in a binary tree\n14-binary_tree_balance.c|\tFunction that measures the balance factor of a binary tree\n15-binary_tree_is_full.c|\tFunction that checks if a binary tree is full\n16-binary_tree_is_perfect.c\t|Function that checks if a binary tree is perfect\n17-binary_tree_sibling.c|\tFunction that finds the sibling of a node\n18-binary_tree_uncle.c\t|Function that finds the uncle of a node\n\n\nmain directory - it conatins all the main.c files used to test each functions in the directory\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbelovetech%2Fbinary_trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbelovetech%2Fbinary_trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbelovetech%2Fbinary_trees/lists"}