Second Largest Inorder Traversal

#include <iostream>
#include <queue>

using namespace std;

class node {
public:
    int data;
    node* left;
    node* right;

    node(int value) {
        data = value;
        left = NULL;
        right = NULL;
    }
};

node* add(node*, int);
void inorder(node*);
void anotherinorder(node*, int&);

int main() {
    int temp;
    int h = 0;      //created h as a tally
    queue<int> q;

    srand(time(NULL));

    for (int h = 0; h < 15; h++) {
        temp = rand() % 99 + 1;     //limit random numbers from 1-99
        q.push(temp);
    }

    node* root = new node(q.front());
    q.pop();

    while (!q.empty()) {
        add(root, q.front());
        q.pop();
    }

    cout << " Random BST values in Inorder: ";
    inorder(root);

    cout << "\n Second largest value is: ";
    anotherinorder(root, h);

    return 0;
}

node* add(node* root, int value) {
    if (root == NULL) {
        root = new node(value);
    }
    else if (value <= root->data) {
        root->left = add(root->left, value);
    }
    else if (value > root->data) {
        root->right = add(root->right, value);
    }

    return root;
}

void inorder(node* nnode) {
    if (nnode == NULL) {
        return;
    }

    inorder(nnode->left);

    cout << nnode->data << ' ';

    inorder(nnode->right);
}

void anotherinorder(node* nnode, int& h) {      //recursion seems to can't affect a referenced data so why not take advantage
    if (nnode == NULL) {
        return;
    }

    h++;        //an increment in every recursion

    anotherinorder(nnode->left, h);

    if (h == 14) {      //another inorder function but can only cout value if it's second to the last which is the second highest in inorder traversal pattern
        cout << nnode->data;
    }

    anotherinorder(nnode->right, h);
}