Find node in a binary search tree

template<typename T>
treenode<T> * find_node_by_data(treenode<T> * root, const T& value) {
 treenode<T> * node = root;
 while (node) {
  if (node->data == value)
   return node;
  if (value > node->data)
   node = node->right;
  else
   node = node->left;
 }
 return nullptr;
}