{"id":20481627,"url":"https://github.com/praabindhp/binary_tree-operations","last_synced_at":"2026-05-26T23:03:21.038Z","repository":{"id":135519771,"uuid":"335516959","full_name":"praabindhp/Binary_Tree-Operations","owner":"praabindhp","description":"C Program For Operations In Binary Tree","archived":false,"fork":false,"pushed_at":"2021-02-22T04:54:01.000Z","size":16,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-16T04:13:02.603Z","etag":null,"topics":["binary-tree","c","code","gcc-compiler","operations","programming-language"],"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/praabindhp.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":"2021-02-03T05:24:56.000Z","updated_at":"2023-01-27T05:16:10.000Z","dependencies_parsed_at":null,"dependency_job_id":"d76ed76f-4c2d-4e20-8897-9c08d0d22e9a","html_url":"https://github.com/praabindhp/Binary_Tree-Operations","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/praabindhp%2FBinary_Tree-Operations","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/praabindhp%2FBinary_Tree-Operations/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/praabindhp%2FBinary_Tree-Operations/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/praabindhp%2FBinary_Tree-Operations/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/praabindhp","download_url":"https://codeload.github.com/praabindhp/Binary_Tree-Operations/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242058081,"owners_count":20065062,"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":["binary-tree","c","code","gcc-compiler","operations","programming-language"],"created_at":"2024-11-15T16:09:13.607Z","updated_at":"2026-05-26T23:03:15.999Z","avatar_url":"https://github.com/praabindhp.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Binary_Tree-Operations\nC Program For Operations In Binary Tree\n\nC is a general-purpose, procedural computer programming language supporting structured programming, lexical variable scope, and recursion, with a static type system. By design, C provides constructs that map efficiently to typical machine instructions.\n\nThe main operations in binary tree are: Search, Insert \u0026 Delete. We will see the worst case time complexity of these operations in binary trees. In a binary tree, a node can have maximum two children.\n\nThis Is A C Program To Illustrate The Operations Done In A Binary Tree\n\nThe Operations Illustrated :\n\n\t1. Insert In Binary Tree\n\t\n\t2. Delete From Binary Tree\n\t\n\t3. Inorder Traversal Of Binary Tree\n\t\n\t4. Postorder Traversal Of Binary Tree\n\t\n\t5. Preorder Traversal Of Binary Tree\n\t\n\t6. Search \u0026 replace\n\t\n\t7. Exit\n\t\nThe User Will Be Prompted To :\n\t\n\t1. Enter Choice\n\t\n\t2. Enter New Element\n\t\n\t3. Enter The Element To Be Deleted\n\t\n\t4. Enter The Element To Be Searched\n\t\n\t5. Replace The Element\n\t\nThe Errors Prompted To The User :\n\n\t1. Invalid Choice - Try Again\n\t\n\t2. Node Not Found\n\t\n\t3. Element Does Not Exist In The Binary Tree\n\nThe GCC File Also Have Been Pushed.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpraabindhp%2Fbinary_tree-operations","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpraabindhp%2Fbinary_tree-operations","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpraabindhp%2Fbinary_tree-operations/lists"}