QUESTION 21 Which is NOT true of the root node of a binary tree? The root node always has exactly one child. The root node has no parent node The root nade is usually displayed at the top of the diagram Searches begin at the root node QUESTION 22 if a binary tree with n nodes is perfectly balanced, the depth of the tree will be roughly 2n n login two to the negative power Log in QUESTION 23 A max-heap structure has which property? Unlike normal binary trees, heaps can never be used to implement priority systems. Every node stores a value that is greater than or equal to the value of either of its children. Every node stores a value that is less than or equal to that of its children. Heaps are, by definition, never complete binary trees. Click Save and Subrrt to save and submit. Click Save All Art to save all answers