Lists

Question 1

What data structure uses a linear list?

Answer 1

Array

Question 2

What is meant by a linked list?

Answer 2

allow us to store items in whatever location is available

Question 3

What is meant by a node?

Answer 3

an element of a list. It can hold many data items.

Question 4

What is meant by a pointer?

Answer 4

A variable that stores an address of a node it is pointing to

Question 5

What is meant by a null pointer?

Answer 5

A pointer that does not point to anything

Question 6

What is meant by a StartPointer?

Answer 6

A variable that stores the address of the first element

Question 7

How is a linked list modified?

Answer 7

By changing what the pointer. It copies into the new nodes pointer field the old content

Question 8

Why are linked list used?

Answer 8

Real life applications (data is more than just a key field) and one data item. That is why linked lists are preferred over linear.

Question 9

How do we reorder linked lists?

Answer 9

If we need to re-order a linked list, all we do is change the pointers that need to be moved.

Question 10

What is a positive of using linked lists?

Answer 10

Saves time

Question 11

What is the disadvantage of using linked lists?

Answer 11

Need more storage space for the pointer files

Question 12

State the advantages of a binary tree

Answer 12

To allow people a faster search than a linear search or a searching a linked list as it is ordered.
Also when adding a new nod other nodes to not need to be moved, only a left or right pointer needs to be added to link the new node to an existing tree.

Question 13

How can we store the binary tree?

Answer 13

In an array of records

Question 14

What is a binary tree made up of?

Answer 14

A root node (start)
A parent or child node
A left subtree
A right subtree
Branches
Terminal node