Exam 3 Flashcards
1
Q
What is a binary tree?
A
A rooted tree which has either (A) a left child (B) a right child (C) a left child and a right child or (D) no children
2
Q
What is a full binary tree?
A
A binary tree in which every vertex has either a left and a right child or no children at all
3
Q
What is the maximum number of nodes on level i of a binary tree?
A
2^i
4
Q
What is the maximum number of nodes in a binary tree of height k?
A
2^(k+1) - 1
5
Q
What is a binary search tree?
A
A binary tree in which L
6
Q
What is pre-order traversal?
A
rLR
7
Q
What is in-order traversal?
A
LrR
8
Q
What is post-order traversal?
A
LRr
9
Q
What is an in-order expression?
A
a + b
10
Q
What is a pre-order expression?
A
+ a b
11
Q
What is a post-order expression
A
a b +
