QUESTION 5 1 points A binary tree is a search tree if O every non-leaf node has children whose key values are less than (or equal to) the parent. O every left child has a key less than the parent and every right child has a key greater than or equal to the parent O in the path from the root to every leaf node, the key of each node is greater than (or equal to) the key of its parent O a node can have a maximum of two children. Senints