{"id":19664566,"url":"https://github.com/sancakerkan/bst-construction-and-manipulation","last_synced_at":"2025-02-27T03:42:45.861Z","repository":{"id":231899764,"uuid":"782990381","full_name":"sancakerkan/BST-Construction-and-Manipulation","owner":"sancakerkan","description":"This project is a Binary Search Tree (BST) implementation in Java. The BST supports various operations such as construction, insertion, listing (inorder traversal), finding parent nodes, and deletion.","archived":false,"fork":false,"pushed_at":"2024-06-30T17:17:24.000Z","size":25,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-10T02:20:18.000Z","etag":null,"topics":["binary-search-tree","bst","java","manipulation"],"latest_commit_sha":null,"homepage":"","language":"Java","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/sancakerkan.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}},"created_at":"2024-04-06T16:18:27.000Z","updated_at":"2024-07-22T10:27:23.000Z","dependencies_parsed_at":null,"dependency_job_id":"63f4dfb9-ef10-4d6f-83ff-02c7d050642d","html_url":"https://github.com/sancakerkan/BST-Construction-and-Manipulation","commit_stats":null,"previous_names":["sancakerkan/programming-languages-hw-1","sancakerkan/bst-construction-and-manipulation"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FBST-Construction-and-Manipulation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FBST-Construction-and-Manipulation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FBST-Construction-and-Manipulation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FBST-Construction-and-Manipulation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sancakerkan","download_url":"https://codeload.github.com/sancakerkan/BST-Construction-and-Manipulation/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240974368,"owners_count":19887296,"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-search-tree","bst","java","manipulation"],"created_at":"2024-11-11T16:18:06.823Z","updated_at":"2025-02-27T03:42:45.839Z","avatar_url":"https://github.com/sancakerkan.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# BST-Construction-and-Manipulation\nThis project is a Binary Search Tree (BST) implementation in Java. The BST supports various operations such as construction, insertion, listing (inorder traversal), finding parent nodes, and deletion.\n## Features\n- **CONSTRUCT [values]**: Constructs a BST from a given list of integers.\n- **INSERT value**: Inserts a new integer into the BST in the correct position.\n- **LIST**: Performs an inorder traversal of the BST and prints the keys in ascending order.\n- **PARENT value**: Finds and prints the parent of a given value in the BST.\n- **DELETE value**: Deletes a specified value from the BST while maintaining the BST properties.\n## Implementation\nThe implementation is done in Java without using any library functions for BST-related operations. The program uses dynamic data structures and recursion for various operations on the tree.\n## Input/Output Specifications\nThe program accepts input commands from the standard input.\nCommands include:\nCONSTRUCT [value1, value2, value3, ..., valueN]\nINSERT value\nLIST\nPARENT value\nDELETE value\nOutputs are printed to the standard output.\n## How to Run\nCompile the code using a Java compiler (e.g., javac).\nRun the executable or the Java class file.\nEnter commands as specified in the input/output specifications.\n## Example Output\n```java\nCONSTRUCT [31, 65, 3, 10, 5, 100, 3, 12]\nINSERT 55\nThe parent of 55 is 65\nLIST\n3 3 5 10 12 31 55 65 100\nPARENT 12\nThe parent of 12 is 10\nPARENT 31\nIt is a root node\nINSERT 1\nThe parent of 1 is 3\nLIST\n1 3 3 5 10 12 31 55 65 100\nINSERT 500\nThe parent of 500 is 100\nLIST\n1 3 3 5 10 12 31 55 65 100 500\nPARENT 5\nThe parent of 5 is 10\nDELETE 5\nLIST\n3 3 10 12 31 65 100\nDELETE 65\nLIST\n3 3 10 12 31 100\nPARENT 100\nThe parent of 100 is 31\nDELETE 31\nRoot changed. The new root is 100\nDELETE 100\nRoot changed. The new root is 3\nLIST\n3 3 10 12\n```\n## Contribution\nContributions are welcome! Feel free to fork the repository and submit pull requests.\n## License\nThis project is licensed under the MIT License. See the [LICENSE](https://github.com/sancakerkan/BST-Construction-and-Manipulation/blob/main/LICENSE) file for more details.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fbst-construction-and-manipulation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsancakerkan%2Fbst-construction-and-manipulation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fbst-construction-and-manipulation/lists"}