Find inorder successor - binary search tree - time complexity O(n), inorder traversal, find all nodes before given node. The solution is not optimal.

FindInOrderSuccessor_BST.cpp

/*
Find binary search tree inorder successor 
*/
bool found = false;
TreeNode result = NULL; 

void findMe(TreeNode* root, TreeNode*givenNode){
  		if(!root)
      return ;

  	findNode(root->left, givenNode);  //9
    if(root == givenNode){
      found = true;
    }
    else if(found == true){  // precursor
      found = false;
      result = root;
      return ;
    }
  	findNode(root->right, givenNode);
  	
}
TreeNode* findNode(TreeNode* root, TreeNode* givenNode){
	findMe(root, givenNode);
  return result;
}