Scribd
Upload
30 views

L N - 09 B S T (BST) M: AB O Inary Earch REE Ethods

This document outlines the objectives and instructions for Lab 09 on Binary Search Trees (BST). The lab contains one main task worth 80 marks to implement a BST using linked lists with methods for constructor, destructor, insertion, removal, searching, and finding minimum, maximum, and total elements. Students are instructed to complete the task individually within the lab time by consulting materials but not copying directly from online sources.

Uploaded by

DeadPool Pool
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views

L N - 09 B S T (BST) M: AB O Inary Earch REE Ethods

This document outlines the objectives and instructions for Lab 09 on Binary Search Trees (BST). The lab contains one main task worth 80 marks to implement a BST using linked lists with methods for constructor, destructor, insertion, removal, searching, and finding minimum, maximum, and total elements. Students are instructed to complete the task individually within the lab time by consulting materials but not copying directly from online sources.

Uploaded by

DeadPool Pool
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

CS 210 – Data Structures and Algorithms Lab Manual

LAB NO. 09
BINARY SEARCH TREE (BST) METHODS
Following are the lab objectives:
Objectives
Lab

1. Implement operations of BST

Student ID Student Name


Obtained
Marks Comments
Marks
Task 1 80
Total
80
Marks

Lab Instructor

1
CS 210 – Data Structures and Algorithms Lab Manual

Lab Objectives and CLOs Mapping

CLOs
Lab Objectives
a B C
1
2

Instructions
 This is individual Lab work/task.
 Complete this lab work within lab timing.
 Discussion with peers is not allowed.
 You can consult any book, notes & Internet.
 Copy paste from Internet will give you negative marks.
 Lab work is divided into small tasks, complete all taskss sequentially.
 Show solution of each lab task to your Lab Instructor.
 In-Lab Exercises/Tasks
 Write your code at provided space after each question
 You need to upload code for all tasks at Google Class.

2
CS 210 – Data Structures and Algorithms Lab Manual

LAB TASKS
Task 1 (80 mark)

Implement Binary Search Tree (BST) using linked list. Make sure you provide following
methods within class;

1. Constructor : initialize pointer(s)


2. Destructor : delete all nodes
3. Insert_Node : insert new node
4. Remove : remove a node
5. Find : find/search a node
6. Get_minimum : return minimum number in the BST
7. Get_maximum : return maximum number in the BST
8. Count_elements: return total number of elements in the BST

(Paste your code here)

You might also like