SOMEONE PLEASE HELP

Suppose you are given a list of students registered in a course and you are required to implement BST of student. Each student in the list has name, regNo and cGpa. You are also required to implement following function (Use this>>>>>>>>> Suppose you are given a list of students registered in a course and you are required to implement BST of student. Each student in the list has name, regNo and cGpa. You are also required to implement following functions.

int BSTheight(Node*) // takes roots as an argument and returns height of the tree

bool completeBST(Node *) // takes roots as an argument and returns true if BST is complete tree and false if its not complete

bool perfectBST(Node *) // takes toots as an argument and returns true if BST is a perfect tree and false if its not perfect. >>>>>>>>>>>>>>>>>>>>AND ADD THE FOLLOWING FUNCTION ON IT)

treeType(Node *) // When root node of a data structure is passed it checks following things

Is it a Tree?

Is it a Binary Tree?

Is it a BST?

The output will be the specific type of tree which is passed in the function.

For example

1 87% 1:28 pm Projectt - Unsaved H . . . 2 10 Tree 1 5 11 The output if root node of this tree is passed in the function will be, it's a Tree Tree 2 4 The output if root node of this tree is passed in the function will be it's a Binary Tree 8 Tree 3 13 The output if root node of this tree is passed in the function will be , it's a Binary Search Tree Figure 4 The output if root node of this structure is passed in the function will be , it's NOT a Tree B I UDA=