{"id":25171269,"url":"https://github.com/basemax/traversalbst","last_synced_at":"2025-10-12T23:57:18.676Z","repository":{"id":151535625,"uuid":"574351897","full_name":"BaseMax/TraversalBST","owner":"BaseMax","description":"This is a simple implementation of Binary Search Tree (BST) in C language. All In-order, Pre-order, and Post-order traversal functions are implemented.","archived":false,"fork":false,"pushed_at":"2023-02-03T17:29:57.000Z","size":92,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-10-03T23:38:31.447Z","etag":null,"topics":["binary-search-tree","binary-tree","bst","c","data-structure","datastructure","ds","inorder","postorder","postorder-traversal","preorder","traversal","tree"],"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/BaseMax.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":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2022-12-05T05:38:26.000Z","updated_at":"2023-02-03T19:41:25.000Z","dependencies_parsed_at":"2023-07-10T14:15:28.441Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/TraversalBST","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/BaseMax/TraversalBST","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTraversalBST","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTraversalBST/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTraversalBST/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTraversalBST/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/TraversalBST/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FTraversalBST/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279013485,"owners_count":26085274,"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","status":"online","status_checked_at":"2025-10-12T02:00:06.719Z","response_time":53,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["binary-search-tree","binary-tree","bst","c","data-structure","datastructure","ds","inorder","postorder","postorder-traversal","preorder","traversal","tree"],"created_at":"2025-02-09T09:19:43.208Z","updated_at":"2025-10-12T23:57:18.671Z","avatar_url":"https://github.com/BaseMax.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Traversal BST (Binary Search Tree)\r\n\r\nThis is a simple implementation of Binary Search Tree (BST) in C language. All In-order, Pre-order, and Post-order traversal functions are implemented.\r\n\r\nThis code is written for educational purposes.\r\n\r\n### Examples\r\n\r\n```text\r\n7 3 2 8 1 11 10 14 12 15\r\n1 2 3 7 8 10 11 12 14 15\r\n7 3 8 2 11 14 15 12 10 1\r\n```\r\n\r\nOR\r\n\r\n```text\r\n2 1 3\r\n1 2 3\r\n2 3 1\r\n```\r\n\r\n### Structure\r\n\r\n```c\r\ntypedef struct node\r\n{\r\n    int data;\r\n    struct node *left;\r\n    struct node *right;\r\n} node;\r\n```\r\n\r\n### Functions\r\n\r\n- `node* create_node(int data)`\r\n- `node* add_to_left(node *root, int data)`\r\n- `node* add_to_right(node *root, int data)`\r\n- `node* put_to_left(node* root, node* left)`\r\n- `node* put_to_right(node* root, node* right)`\r\n- `void print_inorder(node* root)`\r\n- `void print_preorder(node* root)`\r\n- `void print_proorder(node* root)`\r\n- `int find_height(node* root)`\r\n- `void print_space(int n, node* removed)`\r\n- `void print(node* root)`\r\n\r\nCopyright (c) 2022, Max Base\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Ftraversalbst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Ftraversalbst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Ftraversalbst/lists"}