Human trafficking is at an estimated ________ a year industr…

Questions

Humаn trаfficking is аt an estimated ________ a year industry.

The fоllоwing figure shоws red-blаck tree (RBT) in which а squаre denotes a black node, a circle denotes a red node, and the NIL nodes are omitted. The number inside a circle/square is the key value of the corresponding node. The label (upper-case letter) next to a node is a pointer pointing to the memory location of the corresponding node. You should use the label when referring to a node.   (a) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). After BST insertion (before RBT insertion fixup), the parent of O is [a]   (b) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). After BST insertion (before RBT insertion fixup), is O the left child of its parent or the right child of its parent? Write LEFT or RIGHT. [b]   (c) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). After BST insertion (before RBT insertion fixup), which property of the RBT is violated? Select 0 if none of the properties is violated. [c]   (d) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the parent of node E? [d]   (e) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the color of node J? [e]   (f) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the left child of node O? [f]   (g) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the right child of node O? [g]     (h) Suppose that we want to delete node A (with key=40) from the RBT  in the figure. In the resulting RBT, what is the parent of node C? [h]   (i) Suppose that we want to delete node A (with key=40) from the RBT  in the figure. In the resulting RBT, what is the color of node C? Write either BLACK or RED. [i]   (j) Suppose that we want to delete node A (with key=40) from the RBT  in the figure. In the resulting RBT, what is the parent of node G?  [j]   (k) Suppose that we want to delete node A (with key=40) from the RBT  in the figure. In the resulting RBT, what is the color of node G? Write either BLACK or RED. [k]   (l) Suppose that we want to delete node A (with key=40) from the RBT  in the figure. In the resulting RBT, what is the parent of node L?  [l]   (m) Suppose that we want to delete node A (with key=40) from the RBT  in the figure. In the resulting RBT, what is the color of node L? Write either BLACK or RED. [m]