Binary Tree Input Version 1

#include <iostream>

using namespace std;

class node{
    const int defaultVal = 0;

public:
    int val;
    node* left = NULL;
    node* right = NULL;

    node(){
        val = defaultVal;
    }

    node(int value){
        val = value;
    }
};

int main() {
    int numOfNodes, rootVal; cin >> numOfNodes >> rootVal;

    node* root = new node(rootVal);

    for(int i = 0; i < numOfNodes - 1; i++){
        string dir; cin >> dir;
        int val; cin >> val;

        node** nd = &root;
        for(int j = 0; j < dir.size(); j++)
            if(dir[j] == 'L')
                nd = &((*nd)->left);
            else
                nd = &((*nd)->right);

        if(*nd != NULL)
            delete(*nd);
        *nd = new node(val);
    }

    return 0;
}