{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:golang/github.com/basemax/BinaryTreeGo","name":"github.com/basemax/BinaryTreeGo","description":"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.","license":"https://spdx.org/licenses/GPL-3.0","codeRepository":"https://github.com/basemax/BinaryTreeGo","issueTracker":"https://github.com/BaseMax/BinaryTreeGo/issues","url":"https://github.com/basemax/BinaryTreeGo","programmingLanguage":{"@type":"ComputerLanguage","name":"Go"},"dateModified":"2026-07-01","datePublished":"2026-07-01","softwareHelp":{"@type":"WebSite","url":"https://pkg.go.dev/github.com/basemax/BinaryTreeGo#section-documentation"},"applicationCategory":"go","runtimePlatform":"go","developmentStatus":"active","sameAs":["https://pkg.go.dev/github.com/basemax/BinaryTreeGo"]}