7. (40 pts) Answer the following questions on the binary tree node class given b

Question

7. (40 pts) Answer the following questions on the binary tree node class given below template class BTNode public: // members BTNode parent; BTNode* left; BTNode right; E data // given methods BTNode () parent left right NULL; bool hasLeft) return left-NULL; bool hasRight) return right- NULL;) bool isLeaf() return left--NULL && right--NULL;) bool isRoot() return parent NULL; BTNode* connectLeft (BTNode* n) left n; n->parent this; return n;) BTNode* connectRight (BTNode* n) right n n->parent this; return n; int get LetfBranchheight() { return hasLeft() ? left->getHeight() + 1 : 0; } int getRightBranchheight() { return hasRight() ? right->getHeight() + 1 : 0; } int getHeight) return max(getLeftBranchHeight(), getRightBranchHeight)); ) // methods to be filled int getSize); int getDiameter(); void leve10rder(vector& V) BTNode findMin() bool isNorma1Node); bool isNormalTree(); BTNode* normalizeTree)

Explanation / Answer

#include #include #include "Code202_Tree.h" using namespace std; int main(void) { Code202_Tree *theTree; TreeNode *newNode; // Do initialization stuff theTree = new Code202_Tree(); cout iValue = 2; newNode->fValue = 2.3f; strcpy(newNode->cArray, "Node1"); newNode->left = newNode->right = NULL; theTree->Insert(newNode); // Node 2 // Note: Each time a new node is allocated we reuse the same pointer // Access to the previous node is not lost because it is not in the tree. newNode = new TreeNode(); newNode->Key = 4; newNode->iValue = 4; newNode->fValue = 3.4f; strcpy(newNode->cArray, "Node2"); newNode->left = newNode->right = NULL; theTree->Insert(newNode); // Node 3 newNode = new TreeNode(); newNode->Key = 12; newNode->iValue = 8; newNode->fValue = 4.5f; strcpy(newNode->cArray, "Node3"); newNode->left = newNode->right = NULL; theTree->Insert(newNode); // Node 4 newNode = new TreeNode(); newNode->Key = 2; newNode->iValue = 16; newNode->fValue = 5.6f; strcpy(newNode->cArray, "Node4"); newNode->left = newNode->right = NULL; theTree->Insert(newNode); // Node 5 newNode = new TreeNode(); newNode->Key = 6; newNode->iValue = 32; newNode->fValue = 6.7f; strcpy(newNode->cArray, "Node5"); newNode->left = newNode->right = NULL; theTree->Insert(newNode); // Node 6 // Remainder of the nodes are inserted using Insert2() theTree->Insert(10, 7.8f, 64, "Node6"); // Node 7 theTree->Insert(14, 8.9f, 128, "Node7"); // Node 8 theTree->Insert(1, 9.0f, 256, "Node8"); // Node 9 theTree->Insert(3, 0.9f, 512, "Node9"); // Node 10 theTree->Insert(5, 9.8f, 1024, "Node10"); // Node 11 theTree->Insert(7, 8.7f, 2048, "Node11"); // Node 12 theTree->Insert(9, 7.6f, 4096, "Node12"); // Node 13 theTree->Insert(11, 6.5f, 8192, "Node13"); // Node 14 theTree->Insert(13, 5.4f, 16384, "Node14"); // Node 15 theTree->Insert(15, 4.3f, 32768, "Node15"); cout

Related Questions

Navigate

• Browse (All)
• Browse 7
• Subjects

---

---

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