Please read the questions carefully first, and please don\'t just copy the codes

Question

Please read the questions carefully first, and please don't just copy the codes from other sites, someone did that, and the answers didn't even make any sence. This is a c++ problem, thank you very much!!!

Given the following class definitions class BTree; class BTreeNode { friend class BTree; private: int data; BTreeNode *left; BTreeNode *right;}; class BTree { private: BTreeNode *root; public: BTree (); ~BTree (); bool isEmpty(); void insert(const Item &); void preorderTraversal(); void inorderTraversal(); void postorderTraversal();}; Write C++ code for the following questions: Implement the member function isEmpty(). The function returns true is the binary tree is empty, otherwise returns false. Implement the member function inorderTraversal(). The function prints out all the data values of a binary tree by in-order traversal. Implement the destructor ~BTree(). The function deletes all the nodes in a binary tree. The binary tree might be empty.

Explanation / Answer

a)   

b)   

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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