{"id":19647467,"url":"https://github.com/mohazamani/datastructures-with-golang","last_synced_at":"2025-06-20T04:05:14.688Z","repository":{"id":181300079,"uuid":"524576834","full_name":"MohaZamani/DataStructures-With-Golang","owner":"MohaZamani","description":null,"archived":false,"fork":false,"pushed_at":"2022-08-28T10:00:29.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-20T04:03:12.491Z","etag":null,"topics":["binarytree","data-structures","golang","linked-list","stack","trie","trietree"],"latest_commit_sha":null,"homepage":"","language":"Go","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/MohaZamani.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}},"created_at":"2022-08-14T04:58:06.000Z","updated_at":"2024-11-15T13:45:27.000Z","dependencies_parsed_at":"2023-07-14T21:38:58.616Z","dependency_job_id":null,"html_url":"https://github.com/MohaZamani/DataStructures-With-Golang","commit_stats":null,"previous_names":["mzamani18/datastructureswithgolang","mohazamani/datastructures-with-golang"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MohaZamani/DataStructures-With-Golang","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MohaZamani%2FDataStructures-With-Golang","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MohaZamani%2FDataStructures-With-Golang/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MohaZamani%2FDataStructures-With-Golang/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MohaZamani%2FDataStructures-With-Golang/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MohaZamani","download_url":"https://codeload.github.com/MohaZamani/DataStructures-With-Golang/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MohaZamani%2FDataStructures-With-Golang/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260878243,"owners_count":23075955,"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":["binarytree","data-structures","golang","linked-list","stack","trie","trietree"],"created_at":"2024-11-11T14:44:15.384Z","updated_at":"2025-06-20T04:05:09.674Z","avatar_url":"https://github.com/MohaZamani.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# important data structures with Golang\n\nin this repo i implement Trie and LinkList and BinaryTree data structures.\n\n#### Trie\n```\n1. NewNode : for creating a new node in trie or make a root for trie.\n2. insert : for inserting a new Word to Trie. \n3. contains : for checking a word exists or not.\n\n```\n\n#### LinkList\n```\n1. NewLinkList : for creating a new link list.\n2. insertNode : for inserting a data to link list. it insert at back.\n3. GeneralDelete : for deleting a unknown position data.\n4. DeleteFirst : deleting first node. implemented in O(1).\n5. DeleteLast : deleting last node. impelemented in O(n).\n6. print : for printing link list.\n```\n\n#### BinaryTree\n```\n1. NewBinaryTree : for creating new BinaryTree\n2. insert : for inserting a new data to our binary tree.\n3. search : search a data in O(log(n)) and this function return a bool.\n4. PreOrderTraversal : print data of tree in pre order traversal.\n```\n\n\n#### Stack \n```\n1. NewStack : for creating new Stack\n2. Push : push data to last of the Stack in o(1)\n3. Pop : delete and return last element of Stack in O(1)\n4. Top : return last element that exist in the Stack . if the stack be empty it will return -1.\n5. Len : return size of Stack.\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmohazamani%2Fdatastructures-with-golang","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmohazamani%2Fdatastructures-with-golang","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmohazamani%2Fdatastructures-with-golang/lists"}