Construct a recursive algorithm RedRootpath(x), which returns the number 1, if the tree with the root x has a red rootpath. If such a path does not exist, the algorithm will return 0.
Algorithm RedRootpath(x) 1: if (x = nil) then 2: return 0 3: else 4: if (x=RedRootpath) 5: return 1 6: end if *a. **Give the time complexity/Running time of your solution in **O** -notation. * -- Med Venlig Hilsen/Kind regards Rose -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
