Binary tree
Summary
A binary tree is a recursive structure: it is empty, or it is a root with an ordered pair of binary trees as left and right subtrees. Binary trees are a basic data structure, and they are counted by the Catalan numbers. The node binary tree gives the precise definition.
What this node needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Binary_tree, Recursive definition
What links here
Definitions
- Binary tree 02A8EMC83C