Problem p02284 (C++) — buggy submission, verdict: Runtime Error

#include <cstdio>
#include <iostream>
#include <string>
using namespace std;

struct Node {
  int key;
  Node *p, *l, *r;
};

int n;

Node *NIL, *root;

void preorder(Node *u) {
  if (u == NIL)
    return;
  cout << ' ' << u->key;
  preorder(u->l);
  preorder(u->r);
}

void inorder(Node *u) {
  if (u == NIL)
    return;
  inorder(u->l);
  cout << ' ' << u->key;
  inorder(u->r);
}

/*void Postorder(int u){
  if(u == -1) return;
  Postorder(T[u].l);
  Postorder(T[u].r);
  cout << ' ' << u;
}
*/

void insert(int k) {
  Node *y = NIL;
  Node *x = root;

  Node *z;

  z = new Node[1];

  z->key = k;
  z->p = NIL;
  z->r = NIL;
  z->l = NIL;

  while (x != NIL) {
    y = x;
    if (z->key < x->key)
      x = x->l;
    else
      x = x->r;
  }

  z->p = y;

  if (y == NIL) {
    root = z;
  } else if (z->key < y->key)
    y->l = z;
  else
    y->r = z;
}

void find(int k) {
  Node *x = root;
  while (x != NIL) {
    if (k == x->key)
      break;
    else if (k > x->key)
      x = x->r;
    else
      x = x->l;
  }

  if (x == NIL)
    cout << "no" << endl;
  else
    cout << "yes" << endl;
}

int main() {

  int x;

  string s;

  cin >> n;

  for (int i = 0; i < n; i++) {
    cin >> s;
    if (s == "insert") {

      cin >> x;

      insert(x);
    }

    else if (s == "find") {
      cin >> x;
      find(x);
    }

    else {
      inorder(root);
      cout << endl;
      preorder(root);
      cout << endl;
    }
  }

  /*  for(int k = 0; k < n; k++){

      cin >> x;

      for(int i = 0; i < 2; i++){
        cin >> y;
        T[y].parent = x;
        if(i == 0){
        T[x].l = y;
        }
        else{
          T[x].r = y;
        }
      }
    }

  /*
    cout << "Inorder" << endl;
    Inorder(r);
    cout << endl;


    cout << "Preorder" << endl;
    Preparse(r);
    cout << endl;


    cout << "Postorder" << endl;
    Postorder(r);
    cout << endl;
  */

  return 0;
}


Error: -11

Fixed submission:

#include <cstdio>
#include <iostream>
#include <string>
using namespace std;

struct Node {
  int key;
  Node *p, *l, *r;
};

int n;

Node *NIL, *root;

void preorder(Node *u) {
  if (u == NIL)
    return;
  cout << ' ' << u->key;
  preorder(u->l);
  preorder(u->r);
}

void inorder(Node *u) {
  if (u == NIL)
    return;
  inorder(u->l);
  cout << ' ' << u->key;
  inorder(u->r);
}

/*void Postorder(int u){
  if(u == -1) return;
  Postorder(T[u].l);
  Postorder(T[u].r);
  cout << ' ' << u;
}
*/

void insert(int k) {
  Node *y = NIL;
  Node *x = root;

  Node *z;

  z = new Node[1];

  z->key = k;
  z->p = NIL;
  z->r = NIL;
  z->l = NIL;

  while (x != NIL) {
    y = x;
    if (z->key < x->key)
      x = x->l;
    else
      x = x->r;
  }

  z->p = y;

  if (y == NIL) {
    root = z;
  } else if (z->key < y->key)
    y->l = z;
  else
    y->r = z;
}

void find(int k) {
  Node *x = root;
  while (x->key != k || x == NIL) {
    if (k > x->key)
      x = x->l;
    else
      x = x->r;
  }

  if (x == NIL)
    cout << "no" << endl;
  else
    cout << "yes" << endl;
}

int main() {

  int x;

  string s;

  cin >> n;

  for (int i = 0; i < n; i++) {
    cin >> s;
    if (s == "insert") {

      cin >> x;

      insert(x);
    }

    else if (s == "find") {
      cin >> x;
      find(x);
    }

    else {
      inorder(root);
      cout << endl;
      preorder(root);
      cout << endl;
    }
  }

  /*  for(int k = 0; k < n; k++){

      cin >> x;

      for(int i = 0; i < 2; i++){
        cin >> y;
        T[y].parent = x;
        if(i == 0){
        T[x].l = y;
        }
        else{
          T[x].r = y;
        }
      }
    }

  /*
    cout << "Inorder" << endl;
    Inorder(r);
    cout << endl;


    cout << "Preorder" << endl;
    Preparse(r);
    cout << endl;


    cout << "Postorder" << endl;
    Postorder(r);
    cout << endl;
  */

  return 0;
}