{"id":20454945,"url":"https://github.com/little-apps/littledatatrees","last_synced_at":"2025-07-16T12:33:03.547Z","repository":{"id":79015758,"uuid":"107057688","full_name":"little-apps/LittleDataTrees","owner":"little-apps","description":"Demonstrates data tree structures in C#","archived":false,"fork":false,"pushed_at":"2019-05-16T17:55:00.000Z","size":48,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-15T23:25:16.579Z","etag":null,"topics":["avl","balance","bst","csharp","data-tree","tree","tree-structure"],"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/little-apps.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":"2017-10-15T23:46:42.000Z","updated_at":"2021-01-05T11:14:22.000Z","dependencies_parsed_at":"2023-02-24T19:30:20.438Z","dependency_job_id":null,"html_url":"https://github.com/little-apps/LittleDataTrees","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/little-apps%2FLittleDataTrees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/little-apps%2FLittleDataTrees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/little-apps%2FLittleDataTrees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/little-apps%2FLittleDataTrees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/little-apps","download_url":"https://codeload.github.com/little-apps/LittleDataTrees/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242005820,"owners_count":20056434,"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":["avl","balance","bst","csharp","data-tree","tree","tree-structure"],"created_at":"2024-11-15T11:17:27.393Z","updated_at":"2025-03-05T10:18:57.764Z","avatar_url":"https://github.com/little-apps.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Little Data Trees\n[![Build Status](https://travis-ci.org/little-apps/LittleDataTrees.svg?branch=master)](https://travis-ci.org/little-apps/LittleDataTrees)\n\nThis project demonstrates various tree structures using the C# programming language. It is a public domain project.\n\n## License\n\nLittle Data Trees is free and open source, and is licensed under the MIT License.\n\n \u003e Copyright (c) 2017 Little Apps\n \u003e \n \u003e Permission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n \u003e \n \u003e The above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n \u003e \n \u003e THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n## Trees\n\nAll trees implement the ``BaseTree\u003cTNode, TValue\u003e`` abstract class with methods to add, delete, and find nodes in the tree. There is the ability to traverse trees using pre-order, in-order, and post-order and output them horizontally or vertically as text.\n\n### AVL\n\nThe AVL tree is one of the most popular self-balancing binary search trees. It is named after it's two inventors, Georgy Adelson-Velsky and Evgenii Landis. When the tree becomes unbalanced, a single or double rotation (depending on the node balances) is performed to balance it.\n\n### BST\n\nA binary search tree (BST) is unbalanced and the most basic of the data trees. Since they are the most basic, they are easiest to code. \n\n## Show Your Support\n\nLittle Apps relies on people like you to keep our software running. If you would like to show your support for Little Data Trees, then you can [make a donation](https://www.little-apps.com/?donate) using PayPal, Payza or credit card (via Stripe). Please note that any amount helps (even just $1).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flittle-apps%2Flittledatatrees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flittle-apps%2Flittledatatrees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flittle-apps%2Flittledatatrees/lists"}