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.
go golang tree algorithm data-structure algorithms binary-tree tree-structure tree-search datastructure algorithms-datastructures ds algorithms-and-data-structures tree-algorithms tree-data-structure tree-binary
- Updated
Dec 16, 2022 - Go