Question 1 Draw the Red and Black Tree for the keys below. 38,16,29,50,60,20,45, and 70 Question 2 Insert the following keys in an AVL tree: 56, 3, 12, 45, 78, 4, 34, 10 16 and 9. Label the balance factor for each node. Question 3 Using the information in Question 2 above, delete the nodes in the following order: 4 and 12. Question 4 Use the Dijkstra's Graph below find the shortest path from b to f. Calculate the values at each vertex. C 2 2 5 2 f 5 b 3
Question 1 Draw the Red and Black Tree for the keys below. 38,16,29,50,60,20,45, and 70 Question 2 Insert the following keys in an AVL tree: 56, 3, 12, 45, 78, 4, 34, 10 16 and 9. Label the balance factor for each node. Question 3 Using the information in Question 2 above, delete the nodes in the following order: 4 and 12. Question 4 Use the Dijkstra's Graph below find the shortest path from b to f. Calculate the values at each vertex. C 2 2 5 2 f 5 b 3
Related questions
Question
Please see att
Transcribed Image Text:Question 1
Draw the Red and Black Tree for the keys below.
38,16,29,50,60,20,45, and 70
Question 2
Insert the following keys in an AVL tree:
56, 3, 12, 45, 78, 4, 34, 10 16 and 9. Label the balance factor
for each node.
Question 3
Using the information in Question 2 above, delete the nodes in
the following order: 4 and 12.
Question 4
Use the Dijkstra's Graph below find the shortest path from b to f.
Calculate the values at each vertex.
C
2
2
5
2
f
5
b
3
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
