Binary Search Tree
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Jaeha Choi 25a0ce424b Updated output image 10 months ago
actual_output Updated output image 10 months ago
input_data Fix checkComplete and findMin 10 months ago
input_image Added test, merged output image 10 months ago
BinarySearchTree.cpp Height of a tree with one node is now 1 (used to be 0) 10 months ago
BinarySearchTree.h Fix checkComplete and findMin 10 months ago
CMakeLists.txt Add required methods 10 months ago
README.md Update 'README.md' 10 months ago
main.cpp Updated output image 10 months ago

README.md

CSS343 Assignment 1

Due Apr 20 by 11:59pm Points 200

Construct a Binary Search Tree (BST) program in C++. The program is required to:

  1. load the BST from a dataset (I will provide the datasets-see below) in the order they exist in the dataset.

  2. after the BST is built analyze the BST and display the following values:

    1. the smallest branch height

    2. the highest branch height

    3. the number of nodes in the tree

    4. the determination if the tree is balanced

    5. the determination if the tree is complete

Submit (in Canvas) the C++ code and copies of the execution of each of the datasets that display the five values (from above).