Definitions: __ The maximum path length from a node to a leaf node _ Data struct

Question

Definitions:

__ The maximum path length from a node to a leaf 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

_ _ Tree nodes that have the same parent

_ _ A tree node that does not have a parent

__ _ Term 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 n

_ _ ADT used to produce a level-order traversal of a tree

__ _ Tree node that does not have any children

Terms:

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^n

J. Post-Order

K. Level Order

L. 2^(n+1) – 1

M. Siblings

N. Leaf

O. Root node

Explanation / Answer

1) A. Node height

2) G. Binary Tree

3) J. Post-Order

4) M. Siblings

5) O. Root node

6) C. Node Depth

7) D. Binary search tree

8) I. 2^n

9) E. Stack (Not sure)

10) N. Leaf

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.