Definition:Ordered Tree
Definition
Needs a complete rewrite from someone who (a) understands the mathematics and (b) is better in English.
You can help Proof Wiki by completing it.
To discuss it in more detail, feel free to use the talk page.
When this has been done, {{WIP}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Tree T which consist of a single vertex v, called the root of the tree, together with an archard 0, whose trees are called the subtrees of the root v, is known as Ordered Tree.
Please fix formatting and $\LaTeX$ errors and inconsistencies.
It may also need to be brought up to our standard house style.
If you have done this or know it has been done, please remove {{Tidy}} from the code.
You can help ProofWiki by adding these links.
To discuss this in more detail, feel free to use the talk page.
Once you have done so, you can remove this instance of {{MissingLinks}} from the code.
