Data structure expansion Flashcards

1
Q

Step one of data structure expansion

A

Pick an existing known data structure as the base

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

Step two of data structure expansion

A

Decide on an extra data field that will help you accomplish the task

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

Step three of data structure expansion

A

Make sure you can maintain that field using the existing methods of the data structure

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

Step four of data structure expansion

A

Create the new functionality (methods) using the new fields.

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

AVL tree expansion term

A

If f is an expansion field in AVL tree that can be calculated for a node using the data in it’s left and right children, than it can be maintained in insertion and deletion without affecting runtime

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