In a BST, any node in the right subtree of the root is larger than any node in the left subtree. True Faise In a BST, both left and right subtrees of the root are BSTs. True False In a BST, the smallest node is the node farthest from the root in the left subtree (or the leftmost among such nodes in case there are several of them at the same distance from the root). True False Ir takes, on average, significantly less time to find a target value in a BST than when using a binary search in a sorted array that holds the same values. True False It takes more space to store n values in a BST than in a sorted array. True False Tt takes, on average aignificantly leas time to add a value to a BST than to s sorted array that holds the same viluen. True False