Scribd
Upload
36 views2 pages

11 Lab - Student BST

The document provides instructions for a lab assignment on implementing a Binary Search Tree (BST) for managing student records. Students are required to create a class structure for storing student details and implement various member functions for inserting, searching, and traversing the tree. The assignment emphasizes individual work, and students must demonstrate their implementation to the instructor for credit.

Uploaded by

Imran Suleman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views2 pages

11 Lab - Student BST

The document provides instructions for a lab assignment on implementing a Binary Search Tree (BST) for managing student records. Students are required to create a class structure for storing student details and implement various member functions for inserting, searching, and traversing the tree. The assignment emphasizes individual work, and students must demonstrate their implementation to the instructor for credit.

Uploaded by

Imran Suleman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Spring 2023 BSF21 (CS/IT)

Data Structures and Algorithms Lab


Lab 11 Marks 10
Instructions
Work in this lab individually. You can use your books, notes, handouts etc. but you are not allowed to borrow anything from your
peer student.
Marking Criteria
Show your work to the instructor before leaving the lab to get some or full credit.
What you must do
Implement a class for Binary Search Trees (BST). Each node of this tree will store the id, name, and fee of a student existing in a
text file named input.txt. The data in the input file is formatted as follows: each new line contains the student's id, followed by a
blank space, the student's name, another blank space, and finally, the student's fee.

The class definitions will look like:


class Student
{
friend class StudentBST;

private:
int id; /**student identifier (unique).*/
string name; /**student name.*/
float fee; /**student fee.*/
Student* left; /**left subtree of a node.*/
Student* right; /**right subtree of a node.*/
};

class StudentBST
{
private:
Student* root; /**root of the tree.*/
public:
StudentBST(); /**constructor.*/
~StudentBST(); /**destructor.*/
};
You are required to implement the following member functions of the StudentBST class:

bool insert (int id, string name, float fee);


The three arguments of this function are id, name, and fee represent a particular student. This function will check whether a
student with the same id already exists in the tree. If it does not exist, then this function will insert it into the BST at its appropriate
location and return true. If a student with the same id already exists, the function will not insert a new record, and it will return
false.

void search (int id);


This function will search the BST for a student with the given id. If such a student is found, then this function should display the
details (id, name, and fee) of this student. If such a student is not found, then this function should display an appropriate message.

void inOrder ();


This function will perform an in-order traversal of the BST and display the details (id, name, and fee) of each student. It will be a
public member function of the StudentBST class. This function will call the following helper function to achieve its objective.

void inOrder (Student* stree);


This will be a recursive function which will perform the in-order traversal on the sub-tree which is being pointed by stree. It will be
a private member function of the StudentBST class.

void preOrder ();


This function will perform a pre-order traversal of the BST and display the details (id, name, and fee) of each student. It will be a
public member function of the StudentBST class. This function will call the following helper function to achieve its objective.

Umair Babar, FCIT – PU. Lahore. Page 1 of 2


Spring 2023 BSF21 (CS/IT)
void preOrder (Student* stree);
This will be a recursive function which will perform the pre-order traversal on the sub-tree which is being pointed by stree. It will
be a private member function of the StudentBST class.

void postOrder ();


This function will perform a post-order traversal of the BST and display the details (id, name, and fee) of each student. It will be a
public member function of the StudentBST class. This function will call the following helper function to achieve its objective.

void postOrder (Student* stree);


This will be a recursive function which will perform the post-order traversal on the sub-tree which is being pointed by stree. It will
be a private member function of the StudentBST class.

void destroy (Student* stree);


This will be a recursive function which will destroy (deallocate) the nodes of the sub-tree pointed by stree. This function will destroy
the nodes in a post-order way i.e., the left and right sub-trees of a node are destroyed before de-allocating the node itself. This
function will be a private member function of the StudentBST class.

void delete (int id);


Removes a particular Student from the tree based on the id if exist. Show an appropriate messgae in either case. The function should
handle all the boundary cases carefully.

Implement the main function and test the functionality of your created classes by taking data from the input file.

☺ ☺ ☺ BEST OF LUCK ☺ ☺ ☺

Umair Babar, FCIT – PU. Lahore. Page 2 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy