Describe how to implement the weighted union rule efficiently. In particular, describe what information must be stored with each node and how this information is updated when two trees are merged. Modify the implementation of Figure 6.4 to support the weighted union rule.

Transcribed Image Text:

/** General Tree class implementation class ParPtrTree { private Integer [] array; public ParptrTree (int size) { array = new Integer [size]; for (int i=0; i