C program for Algorithms

CSE 2320 Lab Asignment 4 Due August 6, 2018 Goals 1. Understanding of red-black tree structural constraints 2. Application of recursion Requiremests: I. 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, "B" to a black tree node, and a ".to the sentinel If a tree includes n data nodes, then the sentinel will be processedn+ 1 times The input ABC D EF GH IJ(This line is not part of the input) corresponds to the tree: 2 Subemit your program on Blackhoard by 12:45 pm on August 6.One of the comment lines should indicate the compalation command used on OMEGA Getting Started: 1 The following test cases ane usefal: 2 iiYour program may print any dehoegging inforration tha you choone but the last line of your osiput should indicate w hethier oe not the sree satisfies the red-black es propeties Your peogram must ocho the dree recursively fom your data srucure Likewise, your code for neading the tnee must be recursive Your pogram should not peompt fot an isput file rame The maiom ength for the ingur saring is 200 symbols + Poinices ate ot aecessary for smplemiening this agnment Simplc tahles are suices