{"id":19809649,"url":"https://github.com/purejoymind/datastructures","last_synced_at":"2026-06-15T07:33:06.462Z","repository":{"id":190263509,"uuid":"631234522","full_name":"PureJoyMind/DataStructures","owner":"PureJoyMind","description":"Data structures \u0026 Algorithms implemented in C#","archived":false,"fork":false,"pushed_at":"2023-09-26T20:18:36.000Z","size":73,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-28T18:25:37.851Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","csharp","csharp-code","data-structures"],"latest_commit_sha":null,"homepage":"","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/PureJoyMind.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":"2023-04-22T11:20:04.000Z","updated_at":"2023-04-22T12:01:45.000Z","dependencies_parsed_at":"2023-08-23T22:22:07.949Z","dependency_job_id":"fb3933ef-064b-4e60-a040-b28ff608203b","html_url":"https://github.com/PureJoyMind/DataStructures","commit_stats":null,"previous_names":["purejoymind/datastructures"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/PureJoyMind/DataStructures","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PureJoyMind%2FDataStructures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PureJoyMind%2FDataStructures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PureJoyMind%2FDataStructures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PureJoyMind%2FDataStructures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/PureJoyMind","download_url":"https://codeload.github.com/PureJoyMind/DataStructures/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PureJoyMind%2FDataStructures/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34353193,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-15T02:00:07.085Z","response_time":63,"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":["algorithms","algorithms-and-data-structures","csharp","csharp-code","data-structures"],"created_at":"2024-11-12T09:17:43.302Z","updated_at":"2026-06-15T07:33:06.441Z","avatar_url":"https://github.com/PureJoyMind.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structures \u0026 Algorithms\nImplementation of Data structures and algorithm in C#.\n\nI will be doing these in my free time. \n\n# Current list of contents:\n## Data Sructures:\n### Stack\n#### Stack Mehods:\n* Push(object item): Add item to the top of the stack.\n* Pop: Remove the item at the top of the stack.\n* Clear: Clear the stack.\n* PrintStack: Print the current items in the stack.\n* StackImplementation: Just an implementation of the stacks methods. \n### CustomHashTable using Chaining for collision handling:\n#### HashTable Methods:\n* Add(int key, string value): Add a key value set to the table.\n* Get(int key): Get the Entry object of the requested key.\n* GetValue(int key): Get the value of the requested key.\n* Remove(int key): Remove the Entry object with the given key from the table.\n* ImplementHashTable: Just an implementation of the tables methods. \n### Binary Tree \u0026 Binary Search Tree:\nThe main difference between the two classes is the Insert() method. \n#### Binary Tree Properties\n* Root: The root node of the Binary Tree.\n* PreOrder: a Depth-first pre-order traversal of the Binary Tree represented in a string format. (Root, Left, Right)\n* InOrder:  a Depth-first in-order traversal of the Binary Tree represented in a string format. (Left, Root, Right)\n* PostOrder:  a Depth-first post-order traversal of the Binary Tree represented in a string format. (Left, Right, Root)\n* LevelOrder:  a Breadth-first (level-order) traversal of the Binary Tree represented in a string format.\n* Height: The height of the Binary Tree object. Each time we read this property it is updated based on the current status of the tree object.\n* Min: Gets the current minimum value in the tree.\n* IsBinarySearchTree: Returns true if the current tree object is a binary search tree.\n\n#### Binary Tree Methods\n* Find(int value): Returns true if the value argument exists in the tree.\n* BinarySearchTree.Insert(int value): Adds the value in the correct node in the tree which means: The root node is ***Always*** bigger than its left child and smaller than its right child.\n* BinaryTree.Insert(int value): Traverses the tree in level order and inserts the value in the first empty child from left children to right.\n* GetNodesAtDistance(int distance): Gets the nodes at the requested distance from the root node.\n* Equals: Overrides the Equals method in Object class. Checks if the two binary trees have the same values in the same locations.\n\n## Algorithms\n* Sorts: Insertion sort,  Selection sort, Merge sort\n* Inversion Counter using merge sort\n    (i,j) =\u003e j \u003c i\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpurejoymind%2Fdatastructures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpurejoymind%2Fdatastructures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpurejoymind%2Fdatastructures/lists"}