Coding Language: C++

Function Header: TreeNode* deleteNode(TreeNode* root, int key) {}

Definition for a binary tree node:

struct TreeNode { int val; TreeNode *left; TreeNode *right; };

Function used to inorder print the nodes:

void inorderPrint(TreeNode* node) { if (!node) return; inorderPrint(node->left); cout val right); }

The Problem and a key, and returns the root node of the updated BST Note Complete the deleteNode function that accepts a BST Tree Node that the correct implementation will print the increasing inorder list after removal. Example key 3 3 6 2 4 7 After deleteNode (3): 2 6 4 7