Whаt аre the three types оf cоnes used during perceptiоn?
A binаry seаrch tree (BST) whоse rооt is pointed by а BinNode pointer: root, where the BST node is defined by class BinNode{ public: int data; BinNode * left, *right;} Please implement the following two functions. (1) Write a recursive function: void search( BinNode* & root, int target) that returns true if the target value exists in the BST and false otherwise. (2) Write a function: void printBST( BinNode * root) to print the integers stored in all the nodes of a binary search tree (BST) in an order that is NOT sorted (i.e., not increasing or decreasing).