Tree131 (B), 10 (R), 81 (B), 6 (B), 19 (B), N, N, 0 (R), N, N, N, N, N, N, N

Tree 1 value to Remove: Remove the value 31 with the predecessor .Tree 240 (B), 17 (B), 81 (R), N, N, 57 (B), 94 (B), N, N, N, N, N, 75 (R), N, N

Tree 2 value to Remove Remove the value 17.

2. For both trees, record the comma separated sequence for the tree values and colors, as well as the value to remove. Each sequence represents the values and colors of nodes in a tree level-order with N representing NULL or no node. This means the sequence 5 (B), 3 (B), 8 (R), N, N, 6 (B), 9 (B) would produce the following tree: 5 3 8 6 9 Activity 1. Build both trees as indicated by the values and colors you recorded. 2. For both trees, remove the value indicated on the tree page. If a value in a node with two children is to be removed, the page also specifies whether to use the in-order successor and predecessor as the replacement value. Use the algorithm discussed in lectures for preserving the red black tree properties in the resulting tree. Record the values in level order from both of the resulting trees from the steps above. Do not record or report the NULL nodes or the colors of any nodes in your resulting tree. As an example, the level order of values in the tree below is: & $#* @ & $ # @