https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1

int minValue(Node *node) {
  Node *current = node;

  while (current->left != nullptr) {
    current = current->left;
  }
  return (current->data);
}