Home / Get Math Help
Ordered Tree
Definition
A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.
Related terms
A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.