{"id":17231073,"url":"https://github.com/rishabh3112/binary-trees","last_synced_at":"2025-03-25T23:42:13.946Z","repository":{"id":97746321,"uuid":"139615792","full_name":"rishabh3112/Binary-Trees","owner":"rishabh3112","description":"Code to basic binary tree problems follow along 😃🎉","archived":false,"fork":false,"pushed_at":"2018-10-06T03:21:05.000Z","size":17,"stargazers_count":0,"open_issues_count":2,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-30T20:49:13.942Z","etag":null,"topics":["binary-tree","data-structures","iteration","java","recursion"],"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/rishabh3112.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":"2018-07-03T17:20:18.000Z","updated_at":"2018-10-06T03:20:48.000Z","dependencies_parsed_at":"2023-03-13T16:09:27.370Z","dependency_job_id":null,"html_url":"https://github.com/rishabh3112/Binary-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/rishabh3112%2FBinary-Trees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishabh3112%2FBinary-Trees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishabh3112%2FBinary-Trees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishabh3112%2FBinary-Trees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rishabh3112","download_url":"https://codeload.github.com/rishabh3112/Binary-Trees/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245563044,"owners_count":20635907,"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-tree","data-structures","iteration","java","recursion"],"created_at":"2024-10-15T04:54:31.842Z","updated_at":"2025-03-25T23:42:13.922Z","avatar_url":"https://github.com/rishabh3112.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\r\n  \u003cimg src=\"https://avatars2.githubusercontent.com/u/15812317?s=50\u0026v=4\"\u003e\r\n  \u0026\r\n  \u003cimg src=\"https://avatars0.githubusercontent.com/u/14764069?s=50\u0026v=4\"\u003e\r\n\u003c/p\u003e\r\n\r\n# Binary Trees\r\n***Project is now on hold, will be continued soon***\r\n## **Node structure**\r\n```\r\nBTNode \r\n-\u003e data\r\n-\u003e left\r\n-\u003e right\r\n```\r\n\r\n## **Helper Strategies Implemented**\r\n1. depthFirstInput\r\n2. levelOrderInput\r\n3. depthFirstPrint\r\n4. levelOrderPrint\r\n\r\n## **Problem Function**\r\n1. Find Node [`#1`](https://github.com/rishabh3112/binary-trees/issues/1)\r\n2. Height of tree [`#2`](https://github.com/rishabh3112/binary-trees/issues/2)\r\n3. Mirror of tree [`#3`](https://github.com/rishabh3112/binary-trees/issues/3)\r\n4. Diameter of tree without pair [`#6`](https://github.com/rishabh3112/binary-trees/issues/6)\r\n5. Diameter and height of tree with pair [`#7`](https://github.com/rishabh3112/binary-trees/issues/7)\r\n6. In-order traversal [`#8`](https://github.com/rishabh3112/binary-trees/issues/8)\r\n7. Pre-order traversal [`#4`](https://github.com/rishabh3112/binary-trees/issues/4)\r\n8. Post-order traversal [`#5`](https://github.com/rishabh3112/binary-trees/issues/5)\r\n9. Construct Tree From InOrder and preOrder arrays [`#10`](https://github.com/rishabh3112/binary-trees/issues/10)\r\n10. Construct Tree From InOrder and postOrder arrays [`#11`](https://github.com/rishabh3112/binary-trees/issues/11)\r\n11. Sum of all nodes [`#12`](https://github.com/rishabh3112/binary-trees/issues/12)\r\n12. is Balanced [`#13`](https://github.com/rishabh3112/binary-trees/issues/13)\r\n13. Print each level [`#14`](https://github.com/rishabh3112/binary-trees/issues/14)\r\n14. Remove Leaf Nodes [`#15`](https://github.com/rishabh3112/binary-trees/issues/15)\r\n15. Level wise linked list [`#16`](https://github.com/rishabh3112/binary-trees/issues/16)\r\n16. Print ZigZag [`#17`](https://github.com/rishabh3112/binary-trees/issues/17)\r\n#### Contribute\r\n1. Add new problems as issues 😍\r\n2. Submit a pull request with description 😎\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frishabh3112%2Fbinary-trees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frishabh3112%2Fbinary-trees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frishabh3112%2Fbinary-trees/lists"}