help with this c++ question I am having a hard time understanding

(7 points) Considering the statements below, indicate the sum of the values corresponding to all statements that are True. If none are True, the answer should be 0: (1) Given the pre-order traversal of a BST, you can infer the exact structure of the tree (2) The worst-case performance of finding the largest element of a BST is O(1) (4) Two vertices are adjacent if there is a path of any length connecting them (8) In a max-heap each key is greater or equal to the keys of all ancestors 15