[go: up one dir, main page]
Scribd
Upload
14 views1 page

BSCS Lab Tasks (BSTree)

Tree

Uploaded by

Tahir2 Siddiqui
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
14 views1 page

BSCS Lab Tasks (BSTree)

Tree

Uploaded by

Tahir2 Siddiqui
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/ 1

Data Structures Lab

Program: BSCS
Instructor: Ms. Jaweria Jalil

Topic: Binary Search Tree in Data Structures

Lab Tasks
Q1. Perform the following for BST code implementation:

1. Insertion
2. Traversal
3. Updation
4. No insertion for duplicate node value
5. Deletion of specific node (Has no children (leaf node), Has one child, Has two children)
6. Search for a specific value in a BST

Q2. Implement BST for any two real-life scenarios (with minimum 3 attributes of respective
scenario).

Note: The manual should include a well-formatted cover page, a table of contents, the question
statement, followed by the code in text format (font size 11), and clear screenshots of the outputs.
Avoid using AI-generated content, as the understanding of concepts will be assessed. Bring this
manual to the upcoming lab in soft copy form.

For every output, students must display their name and complete ID at the top.

You might also like