Write the definition of a (recursive) member function of the BinarySearch Tree class named countGreaterThan that takes a parameter n of type elemType and returns the number of nodes whose data field is greater than parameter n. Edit Format Table 12pt v Paragraph v |BIUA

In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):

4. Complete the fuction definition given below that takes the root node of a tree as a parameter and returns the count of nodes. int count_nodes(Node *root){ // complete the function }

The following code implementation for an inorder traversal has a "visit" function as a parameter. I do not know how it works and what ways it plays a role in the traversal of the linked list in a binary tree.