Definition:Ordered Tree

Definition
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.