Write a linear-time program to test whether a binary tree satisfies the red-black tree properties. The simple input format corresponds to preorder traversal. An R corresponds to a red tree node, a B to a black tree node, and a . to the sentinel. If a tree includes n data nodes, then the sentinel will be processed n + 1 times. The input BBB..B..BB..RB..BR..R.. ABC D EF GH IJ K (This line is not part of the input. Use C programming