GitHub / BaseMax / CompleteTreeLinkedListGo
This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCompleteTreeLinkedListGo
Stars: 1
Forks: 0
Open issues: 0
License: gpl-3.0
Language: Go
Size: 727 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 2 years ago
Pushed at: over 2 years ago
Last synced at: about 7 hours ago
Commit Stats
Commits: 16
Authors: 2
Mean commits per author: 8.0
Development Distribution Score: 0.125
More commit stats: https://commits.ecosyste.ms/hosts/GitHub/repositories/BaseMax/CompleteTreeLinkedListGo
Topics: complete-tree, data-structure, go, golang, linked-list, linkedlist, tree, tree-complete, tree-search, tree-structure, tree-traversal, tree-traversal-algorithm, tree-traversal-algorithms, trees
Funding Links https://github.com/sponsors/BaseMax