Which of the following best explains how nodes are placed and ordered in a Binary Search Tree (BST)?

a) Nodes are placed iteratively according to the rule: values less than the root go right, and values greater than the root go left.

b) Nodes are placed iteratively according to the rule: values less than the root go left, and values greater than the root go right.

c) Nodes are placed recursively according to the rule: values less than the root go left, and values greater than the root go right.

d) Nodes are placed recursively according to the rule: values less than the root go right, and values greater than the root go left.