6. Write a recursive function named search that takes as input the pointer to the root of a binary tree (not a BST!) and a value K, and returns true if the value K is found and false otherwise. (5 pts)

Try waiting for it for a few minutes and try signing up again if that doesn’t work then leave a rating on the app and a note about the issue. hopefully they will get back to you soon with suggestions that can you. -hope this

These are very for instance for math pemdas parenthesis, exponents, multiplication, division, addition, subtraction without that i would never be able to remember what to do first with it i can remember.