Inserting a new element

Inserting a new element: int insert(bn *p, bn **root) { if (*root && (*root)-data == p-data) return 1; /* already present */ if (!*root) { /* empty tree */ *root = p; return 0; } else if (p-data (*root)-data) insert(p,&((*root)-right)); else insert(p,&((*root)-left)); return 0; } int ins_el(int key, bn **root) { bn *p; p = (bn*)malloc(sizeof(bn)); if (!p) return 2; /* out of memory */ p-data = key; p-left = p-right = NULL; return insert(p,root); } ... zobacz całą notatkę