GitHub / BaseMax / BinaryTreeGo
Implementation of a binary tree in Go. A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A node with no children is called a leaf node. A node cannot have more than two children.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FBinaryTreeGo
PURL: pkg:github/BaseMax/BinaryTreeGo
Stars: 0
Forks: 0
Open issues: 0
License: gpl-3.0
Language: Go
Size: 36.1 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: 5 days ago
Topics: algorithm, algorithms, algorithms-and-data-structures, algorithms-datastructures, binary-tree, data-structure, datastructure, ds, go, golang, tree, tree-algorithms, tree-binary, tree-data-structure, tree-search, tree-structure
Funding Links https://github.com/sponsors/BaseMax