Tree Flashcards

1
Q

T/F - The topmost node is called the root node?

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The root node resides at Level _

A

Level 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Does the root node have a/any parent/s?

A

No, the root node never has a parent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How many children at most can nodes of a Binary tree have?

A

2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Does a leaf node have any children?

A

No, a leaf node has no children.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Sibling nodes have _____

A

the same parent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the depth of the tree?

A

The level of the lowest node.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a sub-tree?

A

A node and it’s ancestors. (Martins answer on ppt, think he actually means descendants)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

‘Strictly Binary Tress’ have all non-leaf nodes which have…?

A

2 immediate descendants

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

‘Complete Binary Trees’ are trees which have all non-leaf nodes at…?

A

the same level

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Non binary trees contain nodes which can have (A) and (B)

A

(A)more than two children

(B)more than one parent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

PreOrder is -

A

root, left, right

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

InOrder is -

A

left, root, right

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

PostOrder

A

left, right, root

How well did you know this?
1
Not at all
2
3
4
5
Perfectly