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 post-order traversal of a BST, you can infer the exact structure of the tree (2) A binary heap is a complete binary tree (4) Assuming a BST with keys between 1 and 500, after searching for 256, the sequence 352, 28, 40, 350, 45, 347, 46 could be a valid sequence of nodes examined (8) Printing each element of a BST tree using a pre-order traversal results in a sorted list of elements 14