proxy.golang.org : github.com/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.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/basemax/%21binary%21tree%21go
Keywords:
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
License: GPL-3.0
Latest release: 4 days ago
Namespace: github.com/basemax
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 4 days ago