Write your own version of a binary tree (do not use templates) that will store E

Question

Write your own version of a binary tree (do not use templates) that will store Employee classes (this is a class that has an integer for an employeeID and a string for the employeeName). Order the tree on the employeeID.

Explanation / Answer

#include #include using namespace std; class binaryTree { public: binaryTree (); int menu (); private: typedef struct dataNode { char arriveCity[30]; char departCity[30]; int totalPassengers; int passengers; int flightNumber; struct dataNode * left; struct dataNode * right; }; dataNode * root; bool insert (dataNode *&, dataNode &); bool search (dataNode *, dataNode &); bool retrieve (dataNode *, dataNode &); void inorder (dataNode *); }; binaryTree::binaryTree() { dataNode * root = NULL; dataNode * left = NULL; dataNode * right = NULL; } bool binaryTree::insert(dataNode*& tree, dataNode &flightNumber) { if (tree == NULL) { tree = new dataNode; tree -> left = NULL; tree -> right = NULL; tree -> flightNumber = flightNumber; return true; } else if (flightNumber == tree -> flightNumber) return false; else if (flightNumber flightNumber) return insert (tree -> left, flightNumber); else return insert (tree -> right, flightNumber); } bool binaryTree::search(dataNode * tree, dataNode &flightNumber) { if (tree == NULL) return false; else if (flightNumber == tree -> flightNumber) return true; else if (flightNumber flightNumber) return search (tree -> left, flightNumber); else return search (tree -> right, flightNumber); } bool binaryTree::retrieve (dataNode * tree, dataNode &flightNumber) { } void binaryTree::inorder (dataNode * tree) { if (tree != NULL) { inorder (tree -> left); cout

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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