6. Trees Trivia: Read carefully. Choose the best answer. Use answers only once. (10 pts) The maximum path length from a node to a leaf node A. Node height B. In-Order C. Node Depth D. Binary search tree E. Stack F. Queue G. Binary Tree H. Pre-Order I. 2 J. Post-Order K. Level Order L. 2+1-1 M. Siblings N. Leaf O. Root node Data structure used to implement a knowledgebase as in the "guess the animal game" A tree traversal that produces a reverse polish notation expression for an expression tree -ree nodes that have the same parent A tree node that does not have a parent -erm that describes the path length from the root to a given node ADT that allows searching with complexity O(log n) Number of leaves in a full binary tree of height rn ADT used to produce a level-order traversal of a tree Tree node that does not have any children