I would say D. natrural selection
Answer:
d) Searching a binary tree for a value that matches a key value is slow for tightly packed trees.
Explanation:
Binary search tree is node based binary tree structure. It has the following features:
Left subtree of a node contains only nodes with keys less than the node keys.
Right subtree of a node contains only nodes with keys greater than the node;s key.
Left & Right subtree each must also a binary search tree.
Inside the seed there are is an embryo the baby plan and cotyledons. When the seed begins to grow, one part of the embryo becomes the plant while the other part becomes the root of the plant.
The answer to the question is D