In computer science, 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 recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set. Some authors allow the binary tree to be the empty set as well.
-
Notifications
You must be signed in to change notification settings - Fork 3
In computer science, 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.
License
Qantax/BinaryTree
About
In computer science, 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.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published