CREATE A MAIN AND A STRUCT TREENODE FOR THIS FUNCTION TO WORK. C++ PLEASE.

-------------------------------------------------------------------------------------------------------------------------------

TreeNode* inorderNext(TreeNode* v) {

if (v->right != nullptr) {

TreeNode* curr = v->right;

while (curr->left != nullptr) {

curr = curr->left;

}

return curr;

}

else {

TreeNode* curr = v;

TreeNode* parent = v->parent;

while (parent != nullptr && curr == parent->right) {

curr = parent;

parent = parent->parent;

}

return parent;

}

}