{"id":15448233,"url":"https://github.com/harisali-git/bst_iterativeinsert","last_synced_at":"2025-06-19T05:04:39.630Z","repository":{"id":47186774,"uuid":"404666081","full_name":"HarisAli-git/BST_IterativeInsert","owner":"HarisAli-git","description":"This code is for the iterative insert in the Binary Search Tree","archived":false,"fork":false,"pushed_at":"2021-09-09T09:46:07.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-09T22:41:26.193Z","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":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/HarisAli-git.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}},"created_at":"2021-09-09T09:42:50.000Z","updated_at":"2021-09-09T09:46:09.000Z","dependencies_parsed_at":"2022-09-23T16:11:07.970Z","dependency_job_id":null,"html_url":"https://github.com/HarisAli-git/BST_IterativeInsert","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/HarisAli-git/BST_IterativeInsert","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HarisAli-git%2FBST_IterativeInsert","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HarisAli-git%2FBST_IterativeInsert/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HarisAli-git%2FBST_IterativeInsert/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HarisAli-git%2FBST_IterativeInsert/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HarisAli-git","download_url":"https://codeload.github.com/HarisAli-git/BST_IterativeInsert/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HarisAli-git%2FBST_IterativeInsert/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260690823,"owners_count":23047097,"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":"2024-10-01T20:22:49.278Z","updated_at":"2025-06-19T05:04:34.601Z","avatar_url":"https://github.com/HarisAli-git.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# BST_IterativeInsert\nNormally the insertion in a Binary Search Tree is done by recursion so these few lines of code show that how to achieve the same task by a loop instead of using a recursion. The code seems a bit complicated at first glance but there is just basic things like checks that are getting handeled in this code.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharisali-git%2Fbst_iterativeinsert","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fharisali-git%2Fbst_iterativeinsert","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharisali-git%2Fbst_iterativeinsert/lists"}