Practice Problems for Up-Trees and Kruskal

• Problem 8.1 c (weighted union)

• Problem 8.2 just for the final tree of 8.1c (path compression)

• Problem 9.15 (Kruskal Only) In this problem use the following ordered list as your priority queue.
  1. (E,I)
  2. (C,G)
  3. (E,H)
  4. (E,B)
  5. (F,G)
  6. (A,B)
  7. (B,F)
  8. (I,F)
  9. (A,E)
  10. (A,D)
  11. (H,I)
  12. (D,E)
  13. (D,H)
  14. (F,C)
  15. (I,J)
  16. (J,G)
  17. (B,C)
  18. (E,F)
  19. (F,J)