Data Structures

Question 1

What is the goal of a hash table?

Answer 1

To immediately find an item in a sorted or unsorted list without the need to compare other items in the data set

Question 2

Compare the efficiency of a binary search tree to a hash table when searching for data

Answer 2

Binary search trees are less efficient than hash tables as hash tables can find data immediately without checking other values.

Question 3

Compare the efficiency of a binary search tree to a linked list when searching for data

Answer 3

Binary search trees are more efficient than linked lists because binary search trees don’t need to check every value, as the tree removes half the values each time.

Question 4

How can binary trees represented in memory?

Answer 4

with dictonaries.

tree = {“E”: [“B”,”G”]}

Question 5

Name some uses for binary trees

Answer 5

• Database applications - for efficient searching and sorting is required without moving items.
• Wireless Networking and router tables.
• Operating systems scheduling processes

Question 6

What does each node contain in a binary tree?

Answer 6

Data
Left Pointer
Right Pointer

Question 7

How do you sort a binary search tree?

Answer 7

Using alphabetical / numerical order.
If a word is larger than the parent node, then its moved to the right vise versa…

Question 8

if the next word was “Spratt” where would you put it. (1 or 2)
Jack
1 2

Answer 8

2 because “S”pratt is larger than “J”ack alphabetically wise.