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.
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Binary_tree, Recursive definition
About this page
| Tag | 0D7EZ10V2R |
|---|---|
| URI | m2://0D7EZ10V2R |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C05 |
| Specializes | Rooted tree |
| Same as |
Markdown · JSON · Edit on GitHub
What this page 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)
The writing levels say how complete the text of a page is. They do not measure its truth.