Search results
We did not find results for: height of a binary tree.
Check spelling or type a new query.
We did not find results for: height of a binary tree.
Check spelling or type a new query.
Tree data structure in which each node has at most two children
In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary tree with k = 2. A recursive definition using set theory is that a 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 containing the root. Wikipedia