injava:you are going to start implementing a class for creating and storing Binary Search Trees (BST). Each node of this BST will store the roll number, name and CGPA of a student.
injava:you are going to start implementing a class for creating and storing Binary Search
Trees (BST). Each node of this BST will store the roll number, name and CGPA of a
student. The class definitions will look like:
class StudentBST;
class StudentNode {
friend class StudentBST;
private int rollNo; // Student’s roll number (must be unique)
private string name; // Student’s name
Page | 3
private double cgpa; // Student’s CGPA
private StudentNode left; // Pointer to the left subtree of a node
private StudentNode right; // Pointer to the right subtree of a node
};
class StudentBST {
private StudentNode root; // Pointer to the root node of the tree
public StudentBST(); // Default constructor
};
public bool insert (int, string, double)
This function will insert a new student’s record in the BST. The 3 arguments of this function
are the roll number, name, and CGPA of this new student, respectively. This function will
check whether a student with the same roll number already exists in the tree. If it does not
exist, then this function will make a new node for this new student, insert it into the tree at its
appropriate location, and return true. If a student with the same roll number already exists,
then this function should return false.
Step by step
Solved in 3 steps with 1 images
