Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Previously searched by you
Previously searched by you
logo
  • Analysis & Design
  • Analysis & Design
To add items to your wishlist, you must be logged in
Document preview thumbnail
Preview 2 out of 14 pages
Exam (elaborations)

CS 300 – Analysis & Design | Assignment 5-2 – Binary Search Tree |SNHU| – Pseudocode, Reflection, and Complete C++ Code

0.0
(0 reviews)
- sold
14 pages
2025/2026 Written for academic year
Institution Analysis & Design
Course Analysis & Design
Document preview thumbnail
Preview 2 out of 14 pages

This document covers CS 300 Assignment 5-2 and focuses on implementing a binary search tree (BST) to manage bid data loaded from a CSV file. It includes detailed pseudocode, a reflective analysis, and full C++ source code demonstrating insertion, searching, traversal, and removal operations while maintaining BST order. The assignment emphasizes recursion, pointer safety, and efficient data organization using tree-based structures.

Content preview

Assignment 5-2 Binary Search Tree

1. Pseudocode

Insert(bid)

IF root is NULL:

root ← new Node(bid)

ELSE:

CALL addNode(root, bid)

addNode(node, bid)

IF bid.key < node.key:

IF node.left is NULL:

node.left ← new Node(bid)

ELSE:

CALL addNode(node.left, bid)

ELSE:

IF node.right is NULL:

node.right ← new Node(bid)

ELSE:

CALL addNode(node.right, bid)

Search(bidKey)

current ← root

WHILE current is NOT NULL:

IF bidKey == current.key:

RETURN current.bid

ELSE IF bidKey < current.key:

current ← current.left

ELSE:

, current ← current.right

RETURN NULL

Remove(bidKey)

CALL removeNode(root, bidKey)

removeNode(node, bidKey)

IF node is NULL:

RETURN node

IF bidKey < node.key:

node.left ← removeNode(node.left, bidKey)

ELSE IF bidKey > node.key:

node.right ← removeNode(node.right, bidKey)

ELSE:

IF node.left is NULL AND node.right is NULL:

DELETE node

RETURN NULL

IF node.left is NULL:

temp ← node.right

DELETE node

RETURN temp

IF node.right is NULL:

temp ← node.left

DELETE node

RETURN temp

temp ← findMin(node.right)

node.key ← temp.key

node.bid ← temp.bid

Document information

Uploaded on
December 28, 2025
Number of pages
14
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
Report Copyright Violation
$12.99
Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF
Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
TestbanksNerd
3.4
(18)
Sold
168
Followers
1
Items
460
Last sold
3 days ago
Available in package deal
Product Image
Package deal
CS 300 Analysis & Design – Complete Assignments &Projects Package | All Grade A+
-
-
Sold
8
item
Dec 2025
$112.32
$55.99
You save 50% More Info

Browse related subjects

Subjects

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Learn more Create citation
Working on your references?

Frequently asked questions