// Complete the function to find the height of the binary tree. #include // Code goes here pt1 using namespace std; class Node { public: Node *left; Node *right; int data; Node(int d) { data = d; left = nullptr; right = nullptr; } }; int binaryTreeHeight(Node *root) { // Code goes here pt2 } void deleteTree(Node *root) { if (!root){ return; } deleteTree(root->left); deleteTree(root->right); delete root; } int main() { Node *root1 = new Node(8); root1->left = new Node(7); root1->right = new Node(12); root1->left->left = new Node(3); root1->left->left->right = new Node(9); root1->right->left = new Node(10); root1->right->right = new Node(15); Node *root2 = new Node(8); root2->left = new Node(4); root2->right = new Node(12); root2->left->left = new Node(3); root2->left->right = new Node(6); root2->right->left = new Node(10); root2->right->right = new Node(15); Node *root3 = nullptr; Node *root4 = new Node(42); Node *root5 = new Node(8); root5->left = new Node(7); root5->right = new Node(12); root5->left->left = new Node(3); root5->left->right = new Node(1); root5->left->left->right = new Node(5); root5->left->right->right = new Node(18); root5->left->right->right->left = new Node(19); root5->left->right->right->right = new Node(19); root5->left->left->right->left = new Node(11); root5->left->left->right->left->left = new Node(3); root5->right->left = new Node(10); root5->right->right = new Node(15); cout << binaryTreeHeight(root1) << endl; cout << "Expected: 4" << endl; cout << binaryTreeHeight(root2) << endl; cout << "Expected: 4" << endl; cout << binaryTreeHeight(root3) << endl; cout << "Expected: 0" << endl; cout << binaryTreeHeight(root4) << endl; cout << "Expected: 1" << endl; cout << binaryTreeHeight(root5) << endl; cout << "Expected: 6" << endl; deleteTree(root1); deleteTree(root2); deleteTree(root3); deleteTree(root4); deleteTree(root5); return 1; }