Scribd Logo
Upload

Welcome to Scribd!

  • Homework 6 Instruct

    Uploaded by

    Jennifer Vasquez
    2 views2 pages
    This document provides instructions for Assignment 6 which involves implementing a binary search tree (BST) in C++. Students are given starter code and must write functions in the bst.h header file to make the driver code work correctly with sample input files. The functions should insert nodes into the BST and print the nodes in inorder and preorder traversal format, generating a sorted output list. Students should submit all .cpp and .h files in a zip folder for grading. Points will be awarded for implementing each required BST function and following directions, with deductions for style issues.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for Assignment 6 which involves implementing a binary search tree (BST) in C++. Students are given starter code and must write functions in the bst.h header file to make the driver code work correctly with sample input files. The functions should insert nodes into the BST and print the nodes in inorder and preorder traversal format, generating a sorted output list. Students should submit all .cpp and .h files in a zip folder for grading. Points will be awarded for implementing each required BST function and following directions, with deductions for style issues.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views2 pages

    Homework 6 Instruct

    Uploaded by

    Jennifer Vasquez
    This document provides instructions for Assignment 6 which involves implementing a binary search tree (BST) in C++. Students are given starter code and must write functions in the bst.h header file to make the driver code work correctly with sample input files. The functions should insert nodes into the BST and print the nodes in inorder and preorder traversal format, generating a sorted output list. Students should submit all .cpp and .h files in a zip folder for grading. Points will be awarded for implementing each required BST function and following directions, with deductions for style issues.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    ITP 365: Data structures in C++

    Assignment 6: April 9th, 2014 Due: 11:59pm April 20st, 2014

    Goal
    Well implement a binary tree in the next week and a half. Attached is some starter code and a driver. Youll need to write the functions in bst.h such that the driver works with the input files correctly. Correct output generates a sorted list.

    Requirements
    Attached is a ZIP file containing 2 code files and some sample input files. You must write the functions as indicated in header file. The files will not compile and execute as given. You may add extra functions as needed. More details about the specific functions will be given in class.

    Sample execution
    A successful execution against one of the input files will resemble the following display:

    Page 1 of 2

    Deliverables
    Please submit the all .CPP and .H code files for this project (even ones you did not modify) in a ZIP folder titled Hw6.

    Grading
    Item Points BST constructor function 3 BST destructor function 3 BST empty function 2 BST size function 2 BST insert function 20 BST printInOrderTraversal function 5 BST printPreOrderTraversal function 5 Total* 40 *Points will be deducted for poor style and not following lab guide directions

    Page 2 of 2

    You might also like