{"id":15049026,"url":"https://github.com/hima890/binary_trees","last_synced_at":"2026-01-28T05:24:29.352Z","repository":{"id":242669227,"uuid":"810220622","full_name":"hima890/binary_trees","owner":"hima890","description":"A collection of C programs for learning and implementing binary tree operations, including traversal, insertion, deletion, and validation. Ideal for understanding fundamental data structures and algorithms in C programming.","archived":false,"fork":false,"pushed_at":"2024-10-01T01:38:20.000Z","size":550,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-04T14:44:08.952Z","etag":null,"topics":["algrithm","alx-africa","alx-low-level-programming","betty-style","c-programming-language","data-structures","group-project"],"latest_commit_sha":null,"homepage":"","language":"C","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/hima890.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":"AUTHORS","dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-06-04T09:25:20.000Z","updated_at":"2024-10-01T01:38:23.000Z","dependencies_parsed_at":"2024-10-12T17:03:46.052Z","dependency_job_id":"b92d70f6-4e98-43c4-ae3b-6ef3c94d6e56","html_url":"https://github.com/hima890/binary_trees","commit_stats":{"total_commits":66,"total_committers":3,"mean_commits":22.0,"dds":0.5151515151515151,"last_synced_commit":"d3a876ee4aaeb6cb0a1b5162e08a7715730f0e97"},"previous_names":["hima890/binary_trees"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hima890/binary_trees","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hima890%2Fbinary_trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hima890%2Fbinary_trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hima890%2Fbinary_trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hima890%2Fbinary_trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hima890","download_url":"https://codeload.github.com/hima890/binary_trees/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hima890%2Fbinary_trees/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28840089,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-28T02:10:51.810Z","status":"ssl_error","status_checked_at":"2026-01-28T02:10:50.806Z","response_time":57,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: 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":["algrithm","alx-africa","alx-low-level-programming","betty-style","c-programming-language","data-structures","group-project"],"created_at":"2024-09-24T21:17:41.395Z","updated_at":"2026-01-28T05:24:29.320Z","avatar_url":"https://github.com/hima890.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"![Alt text](image.jpg)\n\n\n# 0x1D C - Binary Trees :\n\n\u003e This project explores the concepts and implementation of binary trees in C, developed collaboratively with [Ruba Salih](https://github.com/Ruba-Salih/). It covers various operations and properties of binary trees, enhancing understanding of data structures and algorithms.\n\n## Key Concepts Explored:\n\n- Understanding binary trees and their structure.\n- Differentiating between binary trees and Binary Search Trees (BST).\n- Comparing time complexity gains compared to linked lists.\n- Exploring tree properties such as depth, height, and size.\n- Implementing different traversal methods for binary trees.\n- Recognizing different types of binary trees: complete, full, perfect, and balanced.\n\n## Tasks Completed :heavy_check_mark:\n\n0. Function that creates a binary tree node.\n1. Function that inserts a node as the left-child of another node.\n2. Function that inserts a node as the right-child of another node.\n3. Function that deletes an entire binary tree.\n4. Function that checks if a node is a leaf.\n5. Function that checks if a given node is a root.\n6. Function that traverses a binary tree using pre-order traversal.\n7. Function that traverses a binary tree using in-order traversal.\n8. Function that traverses a binary tree using post-order traversal.\n9. Function that measures the height of a binary tree.\n10. Function that measures the depth of a node in a binary tree.\n11. Function that measures the size of a binary tree.\n12. Function that counts the leaves in a binary tree.\n13. Function that counts the nodes with at least 1 child in a binary tree.\n14. Function that measures the balance factor of a binary tree.\n15. Function that checks if a binary tree is full.\n16. Function that checks if a binary tree is perfect.\n17. Function that finds the sibling of a node.\n18. Function that finds the uncle of a node.\n19. Function that finds the lowest common ancestor of two nodes.\n20. Function that traverses a binary tree using level-order traversal.\n21. Function that checks if a binary tree is complete.\n22. Function that performs a left-rotation on a binary tree.\n23. Function that performs a right-rotation on a binary tree.\n24. Function that checks if a binary tree is a valid Binary Search Tree (BST).\n25. Function that inserts a value in a Binary Search Tree (BST).\n26. Function that builds a Binary Search Tree (BST) from an array.\n27. Function that searches for a value in a Binary Search Tree (BST).\n28. Function that removes a node from a Binary Search Tree (BST).\n29. Average time complexities of operations on a Binary Search Tree (BST).\n30. Function that checks if a binary tree is a valid AVL Tree (In progress).\n31. Function that inserts a value in an AVL Tree (In progress).\n32. Function that builds an AVL Tree from an array (In progress).\n33. Function that removes a node from an AVL Tree (In progress).\n34. Function that builds an AVL Tree from a sorted array (In progress).\n35. Average time complexities of operations on an AVL Tree (In progress).\n36. Function that checks if a binary tree is a valid Max Binary Heap (In progress).\n37. Function that inserts a value in a Max Binary Heap (In progress).\n38. Function that builds a Max Binary Heap from an array (In progress).\n39. Function that extracts the root node of a Max Binary Heap (In progress).\n40. Function that converts a Binary Max Heap to a sorted array (In progress).\n41. Average time complexities of operations on a Binary Heap (In progress).\n\n## Results :chart_with_upwards_trend:\n\n### Implemented Files:\n\n- [0-binary_tree_node.c](https://github.com/hima890/binary_trees/blob/main/0-binary_tree_node.c)\n- [1-binary_tree_insert_left.c](https://github.com/hima890/binary_trees/blob/main/1-binary_tree_insert_left.c)\n- [2-binary_tree_insert_right.c](https://github.com/hima890/binary_trees/blob/main/2-binary_tree_insert_right.c)\n- [3-binary_tree_delete.c](https://github.com/hima890/binary_trees/blob/main/3-binary_tree_delete.c)\n- [4-binary_tree_is_leaf.c](https://github.com/hima890/binary_trees/blob/main/4-binary_tree_is_leaf.c)\n- [5-binary_tree_is_root.c](https://github.com/hima890/binary_trees/blob/main/5-binary_tree_is_root.c)\n- [6-binary_tree_preorder.c](https://github.com/hima890/binary_trees/blob/main/6-binary_tree_preorder.c)\n- [7-binary_tree_inorder.c](https://github.com/hima890/binary_trees/blob/main/7-binary_tree_inorder.c)\n- [8-binary_tree_postorder.c](https://github.com/hima890/binary_trees/blob/main/8-binary_tree_postorder.c)\n- [9-binary_tree_height.c](https://github.com/hima890/binary_trees/blob/main/9-binary_tree_height.c)\n- [10-binary_tree_depth.c](https://github.com/hima890/binary_trees/blob/main/10-binary_tree_depth.c)\n- [11-binary_tree_size.c](https://github.com/hima890/binary_trees/blob/main/11-binary_tree_size.c)\n- [12-binary_tree_leaves.c](https://github.com/hima890/binary_trees/blob/main/12-binary_tree_leaves.c)\n- [13-binary_tree_nodes.c](https://github.com/hima890/binary_trees/blob/main/13-binary_tree_nodes.c)\n- [14-binary_tree_balance.c](https://github.com/hima890/binary_trees/blob/main/14-binary_tree_balance.c)\n- [15-binary_tree_is_full.c](https://github.com/hima890/binary_trees/blob/main/15-binary_tree_is_full.c)\n- [16-binary_tree_is_perfect.c](https://github.com/hima890/binary_trees/blob/main/16-binary_tree_is_perfect.c)\n- [17-binary_tree_sibling.c](https://github.com/hima890/binary_trees/blob/main/17-binary_tree_sibling.c)\n- [18-binary_tree_uncle.c](https://github.com/hima890/binary_trees/blob/main/18-binary_tree_uncle.c)\n- [100-binary_trees_ancestor.c](https://github.com/hima890/binary_trees/blob/main/100-binary_trees_ancestor.c)\n- [101-binary_tree_levelorder.c](https://github.com/hima890/binary_trees/blob/main/101-binary_tree_levelorder.c)\n- [102-binary_tree_is_complete.c](https://github.com/hima890/binary_trees/blob/main/102-binary_tree_is_complete.c)\n- [103-binary_tree_rotate_left.c](https://github.com/hima890/binary_trees/blob/main/103-binary_tree_rotate_left.c)\n- [104-binary_tree_rotate_right.c](https://github.com/hima890/binary_trees/blob/main/104-binary_tree_rotate_right.c)\n- [110-binary_tree_is_bst.c](https://github.com/hima890/binary_trees/blob/main/110-binary_tree_is_bst.c)\n- [111-bst_insert.c](https://github.com/hima890/binary_trees/blob/main/111-bst_insert.c)\n- [112-array_to_bst.c](https://github.com/hima890/binary_trees/blob/main/112-array_to_bst.c)\n- [113-bst_search.c](https://github.com/hima890/binary_trees/blob/main/113-bst_search.c)\n- [114-bst_remove.c](https://github.com/hima890/binary_trees/blob/main/114-bst_remove.c)\n- [115-O](https://github.com/hima890/binary_trees/blob/main/115-O)\n- [120-binary_tree_is_avl.c](https://github.com/hima890/binary_trees/blob/main/120-binary_tree_is_avl.c)\n\n### Additional Information :construction:\n# Project Structre\n.\n├── 0-binary_tree_node.c\n├── 100-binary_trees_ancestor.c\n├── 101-binary_tree_levelorder.c\n├── 101-main.c\n├── 102-binary_tree_is_complete.c\n├── 103-binary_tree_rotate_left.c\n├── 104-binary_tree_rotate_right.c\n├── 10-binary_tree_depth.c\n├── 110-binary_tree_is_bst.c\n├── 111-bst_insert.c\n├── 112-array_to_bst.c\n├── 113-bst_search.c\n├── 114-bst_remove.c\n├── 115-O\n├── 11-binary_tree_size.c\n├── 120-binary_tree_is_avl.c\n├── 120-is_avl\n├── 120-main.c\n├── 121-avl_insert.c\n├── 122-array_to_avl.c\n├── 123-avl_remove.c\n├── 124-sorted_array_to_avl.c\n├── 12-binary_tree_leaves.c\n├── 130-binary_tree_is_heap.c\n├── 13-binary_tree_nodes.c\n├── 14-binary_tree_balance.c\n├── 15-binary_tree_is_full.c\n├── 16-binary_tree_is_perfect.c\n├── 17-binary_tree_sibling.c\n├── 18-binary_tree_uncle.c\n├── 1-binary_tree_insert_left.c\n├── 2-binary_tree_insert_right.c\n├── 3-binary_tree_delete.c\n├── 4-binary_tree_is_leaf.c\n├── 5-binary_tree_is_root.c\n├── 6-binary_tree_preorder.c\n├── 7-binary_tree_inorder.c\n├── 8-binary_tree_postorder.c\n├── 9-binary_tree_height.c\n├── AUTHORS\n├── binary_tree_print.c\n├── binary_trees.h\n├── LICENSE\n├── Notes\n│   ├── c.txt\n│   └── github.txt\n├── output\n│   └── binary_trees\n└── README.md\n#### Note:\nFunctions files cant run without the main test case file\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhima890%2Fbinary_trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhima890%2Fbinary_trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhima890%2Fbinary_trees/lists"}