Indicate the hundreths placement for the decimal below: 0.28…
Questions
Indicаte the hundreths plаcement fоr the decimаl belоw: 0.28625
The fоllоwing figure shоws а red-blаck tree (RBT) T in which а circle denotes a red node, a square denotes a black node, and the NIL nodes are not shown (to save space). 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 key 28 into the tree in the figure. We first allocate memory for a tree node Q and set its color to red and its key to 28. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), the parent of Q is [a] (b) Suppose that we want to insert key 28 into the tree in the figure. We first allocate memory for a tree node Q and set its color to red and its key to 28. Then we insert it into tree T as if inserting into a binary search tree. After BST insertion (before RBT insertion fixup), which property of RBT is violated? [b] (c) Suppose that we want to insert key 28 into the tree in the figure. We first allocate memory for a tree node Q and set its color to red and its key to 28. Then we insert it into tree T as if inserting into a binary search tree. In the resulting RBT, (after RBT insertion fixup), the color of node D is [c] (d) Suppose that we want to insert key 28 into the tree in the figure. We first allocate memory for a tree node Q and set its color to red and its key to 28. Then we insert it into tree T as if inserting into a binary search tree. In the resulting RBT, (after RBT insertion fixup), the left child of node D is [d] (e) Suppose that we want to insert key 28 into the tree in the figure. We first allocate memory for a tree node Q and set its color to red and its key to 28. Then we insert it into tree T as if inserting into a binary search tree. In the resulting RBT, (after RBT insertion fixup), the right child of node D is [e] (f) Suppose that we want to delete the node H with key 55 from the RBT. After the BST deletion (before the RBT deletion fixup), what is the right child of node F? [f] (g) Suppose that we want to delete the node H with key 55 from the RBT. In the resulting RBT (after the deletion fixup), what is the right child of node F? [g] (h) Suppose that we want to delete the node H with key 55 from the RBT. In the resulting RBT (after the deletion fixup), what is the color of node B? [h] (i) Suppose that we want to delete the node H with key 55 from the RBT. In the resulting RBT (after the deletion fixup), what is the color of node I? [i] (j) Suppose that we want to delete the node H with key 55 from the RBT. In the resulting RBT (after the deletion fixup), what is the color of node G? [j]