{"id":21307580,"url":"https://github.com/jdegand/odin-project-binary-search-trees","last_synced_at":"2025-03-15T20:12:58.947Z","repository":{"id":58163931,"uuid":"528584353","full_name":"jdegand/odin-project-binary-search-trees","owner":"jdegand","description":"Odin Project Javascript - Computer Science - Binary Search Trees","archived":false,"fork":false,"pushed_at":"2022-08-29T19:56:19.000Z","size":32,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-22T09:13:11.333Z","etag":null,"topics":["computer-science","odin-project"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/jdegand.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}},"created_at":"2022-08-24T20:29:37.000Z","updated_at":"2023-04-03T02:55:00.000Z","dependencies_parsed_at":"2022-09-01T12:20:54.205Z","dependency_job_id":null,"html_url":"https://github.com/jdegand/odin-project-binary-search-trees","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/jdegand%2Fodin-project-binary-search-trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdegand%2Fodin-project-binary-search-trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdegand%2Fodin-project-binary-search-trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdegand%2Fodin-project-binary-search-trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jdegand","download_url":"https://codeload.github.com/jdegand/odin-project-binary-search-trees/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243785089,"owners_count":20347409,"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":["computer-science","odin-project"],"created_at":"2024-11-21T16:33:09.119Z","updated_at":"2025-03-15T20:12:58.928Z","avatar_url":"https://github.com/jdegand.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Odin Project Binary Search Trees\n\n[Odin Project Directions](https://www.theodinproject.com/lessons/javascript-binary-search-trees)\n\n## Table of Contents\n\n- [Screenshots](#screenshots)\n- [How to use](#how-to-use)\n- [Thoughts](#thoughts)\n- [Useful Resources](#useful-resources)\n\n## Screenshots \n\n![](terminal-output-1.png)\n\n![](terminal-output-2.png \"Inserted 3 numbers to unbalance tree\")\n\n![](terminal-output-3.png)\n\n## How To Use\n\nTo clone and run this application, you'll need [Git](https://git-scm.com) and [Node.js](https://nodejs.org/en/download/) (which comes with [npm](http://npmjs.com)) installed on your computer. From your command line:\n\n```bash\n# Clone this repository\n$ git clone https://jdegand.github.io/odin-project-binary-search-trees\n\n# Change into the directory\n$ cd odin-project-binary-search-trees\n\n# Run the script\n$ node bst\n```\n\n## Thoughts\n\n- Started by making tree root always null - changed much later to having a random array turned into a balanced bst set as root\n- Had to compare and contrast code with other people's code a lot\n- Watched various leet code demonstrations of binary search tree problems as well \n- Binary search trees are harder to conceptualize mentally without pen and paper - never quite sure it is working correctly\n- While working on this, odin project directions were updated with a prettyPrint function that really helped visualize what is going on\n\n## Useful Resources \n\n- [Github](https://github.com/rafetbasturk/odin-binarySearchTrees) - bst implementation from rafetbasturk\n- [Github](https://github.com/Roxanoel/binary-search-trees) - bst implementation from roxanoel\n- [Geeks for Geeks](https://www.geeksforgeeks.org/how-to-determine-if-a-binary-tree-is-balanced/) - determine if a binary tree is balanced\n- [YouTube](https://www.youtube.com/watch?v=-z4g2qW-d3M) - balance a binary search tree\n- [YouTube](https://www.youtube.com/watch?v=i1m-rywzw68) - validate binary search tree\n- [Stack Overflow](https://stackoverflow.com/questions/5836833/create-an-array-with-random-values) - create an array with random values\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjdegand%2Fodin-project-binary-search-trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjdegand%2Fodin-project-binary-search-trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjdegand%2Fodin-project-binary-search-trees/lists"}