Decision Trees Flashcards
1
Q
Decisions in Decision Trees are usually ___ and check ___
A
binary
a single value
2
Q
Decision Trees can be implemented using ___ to represent the nodes
A
a single Abstract Class
3
Q
Do Decision Trees allow for random decisions?
A
Yes
4
Q
Are Decisions trees designed to run every frame or every few frames?
A
Yes
5
Q
Balanced trees have an efficiency of O(___)
A
log2 n
6
Q
Very Unalanced trees have an efficiency of O(___)
A
O(n)
7
Q
With the random decision node the initial decision is decided ___
A
randomly
8
Q
STUDY SLIDE 9
A
…
