Binary search tree in C

Question

I need to use a binary search tree to organize data. In each node I need to have ID and name, but I don’t know how to put two values in the same node. The tree I’m using is as follows:

struct No {
  int data;
  struct No *left;
  struct No *right;
};
typedef struct No No;

What should I change to store two data on each node?

Answer 1

Just add as much data as you want into that struct.

For example:

struct No {
    int id;
    char nome[64];
    struct No *left;
    struct No *right;
};

typedef struct No No;