Page 1 of 1
A tree is ordered if there is a meaningful linear order among the children of each node Every node has a value less than
Posted: Mon Jun 06, 2022 5:19 pm
by answerhappygod
- A Tree Is Ordered If There Is A Meaningful Linear Order Among The Children Of Each Node Every Node Has A Value Less Than 1 (48.45 KiB) Viewed 34 times
A tree is ordered if there is a meaningful linear order among the children of each node Every node has a value less than any of its children, and the root node has the lowest value of all. Every node has a value greater than its left child, and less than its right child. O Every node has a value that is an average of the values of its children, and zero if it does not have children.