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...

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 Assignment 4 code and add the following function in 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

Tree 1

The output if root node of this tree is passed in the function will be, it’s a Tree



Capital University of Science and Technology Islamabad Data structures Project Submission Date: 4th Jan, 2020 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 Assignment 4 code and add the following function in 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 Tree 1 The output if root node of this tree is passed in the function will be, it’s a Tree Tree 2 The output if root node of this tree is passed in the function will be , it’s a Binary Tree Tree 3 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