{"id":23980495,"url":"https://github.com/polymathuniversata/binary_trees","last_synced_at":"2025-07-11T15:40:51.556Z","repository":{"id":230507915,"uuid":"779539656","full_name":"polymathuniversata/binary_trees","owner":"polymathuniversata","description":null,"archived":false,"fork":false,"pushed_at":"2024-03-30T05:01:56.000Z","size":20,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-03T22:27:40.020Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/polymathuniversata.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}},"created_at":"2024-03-30T05:00:32.000Z","updated_at":"2024-03-30T05:01:53.000Z","dependencies_parsed_at":"2024-04-03T13:53:18.539Z","dependency_job_id":null,"html_url":"https://github.com/polymathuniversata/binary_trees","commit_stats":null,"previous_names":["polymathuniversata/binary_trees"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/polymathuniversata/binary_trees","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fbinary_trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fbinary_trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fbinary_trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fbinary_trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/polymathuniversata","download_url":"https://codeload.github.com/polymathuniversata/binary_trees/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fbinary_trees/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264842177,"owners_count":23671946,"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":[],"created_at":"2025-01-07T10:15:21.427Z","updated_at":"2025-07-11T15:40:51.281Z","avatar_url":"https://github.com/polymathuniversata.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Binary trees\n\nProject done during **Full Stack Software Engineering studies** at **ALX**. It aims to learn about what is a binary tree, the different traversal methods to go through a binary tree and the different types of binary trees (complete, full, perfect and balanced).\n\n## Technologies\n* Scripts written in Bash 4.3.11(1)\n* C files are compiled using `gcc 4.8.4`\n* Tested on Ubuntu 14.04 LTS\n\n## Files\n\n| Filename | Description |\n| -------- | ----------- |\n| `0-binary_tree_node.c` | Function that creates a binary tree node |\n| `1-binary_tree_insert_left.c` | Function that inserts a node as the left-child of another node |\n| `2-binary_tree_insert_right.c` | Function that inserts a node as the right-child of another node |\n| `3-binary_tree_delete.c` | Function that deletes an entire binary tree |\n| `4-binary_tree_is_leaf.c` | Funciton that checks if a node is a leaf |\n| `5-binary_tree_is_root.c` | Function that checks if a given node is a root |\n| `6-binary_tree_preorder.c` | Function that goes through a binary tree using pre-order traversal |\n| `7-binary_tree_inorder.c` | Function that goes through a binary tree using in-order traversal |\n| `8-binary_tree_postorder.c` | Function that goes through a binary tree using post-order traversal |\n| `9-binary_tree_height.c` | Function that measures the height of a binary tree |\n| `10-binary_tree_depth.c` | Function that measures the depth of a node in a binary tree |\n| `11-binary_tree_size.c` | Funciton that measures the size of a binary tree |\n| `12-binary_tree_leaves.c` | Function that counts the leaves in a binary tree |\n| `13-binary_tree_nodes.c` | Function that counts the nodes with at least 1 child in a binary tree |\n| `14-binary_tree_balance.c` | Function that measures the balance factor of a binary tree |\n| `15-binary_tree_is_full.c` | Function that checks if a binary tree is full |\n| `16-binary_tree_is_perfect.c` | Function that checks if a binary tree is perfect |\n| `17-binary_tree_sibling.c` | Function that finds the sibling of a node |\n| `18-binary_tree_uncle.c` | Function that finds the uncle of a node |\n| `100-binary_trees_ancestor.c` | Funciton that finds the lowest common ancestor of two nodes |\n| `101-binary_tree_levelorder.c` | Function that goes through a binary tree using level-order traversal |\n| `102-binary_tree_is_complete.c` | Function that checks if a binary tree is complete |\n| `103-binary_tree_rotate_left.c` | Function that performs a left-rotation on a binary tree |\n| `104-binary_tree_rotate_right.c` | Function that performs a right-rotation on a binary tree |\n| `110-binary_tree_is_bst.c` | Function that checks if a binary tree is a valid Binary Search Tree |\n| `111-bst_insert.c` | Function that inserts a value in a Binary Search Tree |\n| `112-array_to_bst.c` | Funciton that builds a Binary Search Tree from an array |\n| `113-bst_search.c` | Function that searches for a value in a Binary Search Tree |\n| `114-bst_remove.c` | Function that removes a node from a Binary Search Tree |\n| `115-O` | File with the average time complexities of inserting a value, removing and searching a node on a Binary Search Tree |\n| `120-binary_tree_is_avl.c` | Function that checks if a binary tree is a valid AVL Tree |\n| `121-avl_insert.c` | Function that inserts a value in an AVL Tree |\n| `122-array_to_avl.c` | Function that builds an AVL tree from an array |\n| `123-avl_remove.c` | Function that removes a node from an AVL tree |\n| `124-sorted_array_to_avl.c` | Funciton that builds an AVL tree from an array |\n| `125-O` | File with the average time complexities of inserting a value, removing and searching a node on a AVL Tree |\n| `130-binary_tree_is_heap.c` | Function that checks if a binary tree is a valid Max Binary Heap |\n| `131-heap_insert.c` | Function that inserts a value in Max Binary Heap |\n| `132-array_to_heap.c` | Function that builds a Max Binary Heap tree from an array |\n| `135-O` | File with the average time complexities of inserting a value, removing and searching a node on a Binary Heap |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpolymathuniversata%2Fbinary_trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpolymathuniversata%2Fbinary_trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpolymathuniversata%2Fbinary_trees/lists"}