Exce File Edit Vie Insert Format Tools Data Window Help 98% Sat 4:37 PM a E a vl

Question

Exce File Edit Vie Insert Format Tools Data Window Help 98% Sat 4:37 PM a E a vlookupprojectinstructionsfinal Search Shee Home ert Page Layout Formulas Data Review View 33 1 Vlookup assignment We are going to create invoices using the vlookup function for product prices and shipping costs We will group the sheet tabs to minimize the typing required. Sheet tabs will be renamed When using lookup tables, true yields the closest lowest match, not necessarily the closest match For example, 197 will match 100 not 200 Sheet tab names can have spaces Open a new file, and click on sheet tab 1, 2, and 3 (you can use the control key or the shift key as they are adjacent tabs T contrary to when Right click on the highlighted tabs and chose insert, worksheet, ok ce you had clicked on 3 worksheets first, your actio resulted in 3 new n we do range 10 Rename the worksheet tabs: 11 sheet 1 Product List (right click on the tab, chose rename and type the name Sheet 2 Shipping Cost 12 Sheet 3 Sales Invoice 1.15 remember from accounting the term 1/15 meant if paid within 15 days, you could tak 14 Sheet 4 Sales Invoice 2 10 (if pay within 10 days of invoice date, you can take a 2% discount) Sheet 5 Sales Invoice net 30 money due 30 days from date of invoice) Sheet 6 Sales Invoice EOM money due at the end of the month 16 17 Reorder sheets so that Product list is in the first sheet position, Shipping Cost is in second, etc. through 6th place 18 Click on the Product List tab (Remember this is formerly Sheet 1 which has now been renamed) column b on this worksheet indicates th cell where the information in column c should be entered, when necessary e 19 Your name 20 d1. Product cookies coffee 25 a8 Creamer cell to put information in from column C muffins. formation to be entered in cell indicated in column B 28 29 plates nstructions Prouduct List Shiping Cos Sales invoice 1 Sales Invoice 2 10 Sales Invoice net 30 Sales invoice EOM Ready 25%

Explanation / Answer

#include "BSTree.h"
template <typename DataType, category KeyType>
BSTree<DataType, KeyType>::BSTreeNode::BSTreeNode ( const DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode *rightPtr )

template < typename DataType, category KeyType >
BSTree<DataType, KeyType>::BSTree ()

template < typename DataType, category KeyType >
BSTree<DataType, KeyType>::BSTree ( const BSTree<DataType,KeyType>& alternative )

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>:: copyTree(const BSTree<DataType, KeyType> &otherTree)

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>:: copyTreeHelper(BSTreeNode *&p, const BSTreeNode *otherPtr)

}
template < typename DataType, category KeyType >
BSTree<DataType, KeyType>& BSTree<DataType, KeyType>:: operator= ( const BSTree<DataType,KeyType>& alternative )

template < typename DataType, category KeyType >
BSTree<DataType, KeyType>::~BSTree ()

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>::insert ( const DataType& newDataItem )

template < typename DataType, category KeyType >
bool BSTree<DataType, KeyType>::retrieve ( const KeyType& searchKey, DataType& searchDataItem ) const
come back false;
}
template < typename DataType, category KeyType >
bool BSTree<DataType, KeyType>::remove ( const KeyType& deleteKey )
come back false;
}
template < typename DataType, category KeyType >
bool BSTree<DataType, KeyType>::removeHelper(BSTreeNode *&p, const KeyType& deleteKey)

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>::writeKeys () const

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>::writeLTHelper(BSTreeNode *p, const KeyType& searchKey) const

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>::clear ()

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>::clearHelper(BSTreeNode *p)

template < typename DataType, category KeyType >
bool BSTree<DataType, KeyType>::isEmpty () const
come back false;
}
template < typename DataType, category KeyType >
int BSTree<DataType, KeyType>::getHeight () const

template < typename DataType, category KeyType >
int BSTree<DataType, KeyType>::getHeightHelper(BSTreeNode *p) const

template < typename DataType, category KeyType >
int BSTree<DataType, KeyType>::getCount () const

template < typename DataType, category KeyType >
int BSTree<DataType, KeyType>::getCountHelper(BSTreeNode *p) const

template < typename DataType, category KeyType >
void BSTree<DataType, KeyType>::writeLessThan ( const KeyType& searchKey ) const

#include "show9.cpp"
/////////////////////////////////////////////////////////////////////////////////////////
Class declarations for the joined implementation of the Binary
// Search Tree ADT -- together with the algorithmic helpers of the
// public member functions
//
//--------------------------------------------------------------------
#ifndef BSTREE_H
#define BSTREE_H
#include <stdexcept>
#include <iostream>
using namespace std;
template < typename DataType, category KeyType > // DataType : tree information item
class BSTree // KeyType : key field
builder
BSTree(); // Default creator
BSTree(const BSTree<DataType, KeyType>& other); // Copy creator
BSTree& operator= (const BSTree<DataType, KeyType>& other);
// full assignment operator
// Destructor
~BSTree();
// Binary search tree manipulation operations
void insert(const DataType& newDataItem); // Insert information item
bool retrieve(const KeyType& searchKey, DataType& searchDataItem) const;
// Retrieve information item
bool remove(const KeyType& deleteKey); // take away information item
void writeKeys() const; // Output keys
void clear(); // Clear tree
// Binary search tree standing operations
bool isEmpty() const; // Tree is empty
// !! isFull() has been retired. Not terribly helpful in a very joined structure.
// Output the tree structure -- utilized in testing/debugging
void showStructure() const;
// In-lab operations
int getHeight() const; // Height of tree
int getCount() const; // variety of nodes in tree
void writeLessThan(const KeyType& searchKey) const; // Output keys < searchKey
protected:
category BSTreeNode // Inner category: helper for the BSTree class
{
public:
// creator
BSTreeNode(const DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode *rightPtr);
// information members
DataType informationItem; // Binary search tree data item
BSTreeNode *left, // Pointer to the left kid
*right; // Pointer to the correct kid
};
// algorithmic helpers for the general public member functions -- insert
// prototypes of those functions here.
void insertHelper(BSTreeNode *&p, const DataType &newDataItem);
bool retrieveHelper(BSTreeNode *p, const KeyType& searchKey, DataType &searchDataItem) const;
bool removeHelper(BSTreeNode *&p, const KeyType& deleteKey);
// cutRightmose utilized in one implementation of take away.
void cutRightmost(BSTreeNode *&r, BSTreeNode *&delPtr);
void writeKeysHelper(BSTreeNode *p) const;
void clearHelper(BSTreeNode *p);
void showHelper(BSTreeNode *p, int level) const;
int getHeightHelper(BSTreeNode *p) const;
int getCountHelper(BSTreeNode *p) const;
void writeLTHelper(BSTreeNode *p, const KeyType& searchKey) const;
void copyTree(const BSTree<DataType, KeyType> &otherTree);
void copyTreeHelper(BSTreeNode *&p, const BSTreeNode *otherPtr);
// information member
BSTreeNode *root; // Pointer to the basis node
};
#endif // outline BSTREE_H

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.