Write a C Program for red/back tree

1. Use C to implement 1) serialization/marshalling/unloading/flattening of a red/black tree to a string and 2) the inverse operation of deserializing/unmarshalling/loading/unflattening a string to a red/black tree. Both operations are based on the recursive pre-order traversal of a binary tree.

The input is 1) the number of bytes in a string (including the NULL terminator), 2) a string no longer than the indicated length corresponding to a red-black tree, 3) n, the number of keys to be inserted into the tree, and 4) the n integers to be inserted into the tree.

The output is 1) the length (including the NULL terminator) of a string corresponding to the final redblack tree (after insertions) and 2) the string corresponding to the final red-black tree.

In the serialized version of a tree, . indicates the sentinel. Each key will be immediately followed by a letter r or b indicating its color. Optionally, a key may include a sign (+ or -). Three examples follow:

40 20 100 10 60 120 0 50 80 110 140 0 0 070 900 0 130 160 0 150 170 40b20b10b..30b..100r60b50b..80r70b. .90b..120b110b. .140rl30b. .160b150r..170r.. 20 10 30 70 30 40b20b10r..30r. .60b50r..70r.. 40 20 100 10 60 120 0 50 80 110 140 0 0 070 900 0 130 160 0 150 170 40b20b10b..30b..100r60b50b..80r70b. .90b..120b110b. .140rl30b. .160b150r..170r.. 20 10 30 70 30 40b20b10r..30r. .60b50r..70r