isort.h #ifndef BTREEH #define BTREEH // binary tree class class Btree { public: // insert a pointer associated with a key into the list class BtNode *Insert(int key, void *iptr); // delete a node class BtNode *Delete(class BtNode *bt); //…

#include <stdio.h> #include <stdlib.h> #include "isort.h" #define NDAT 100000 #define DIM 10 class Obj { public: BtNode *bn[DIM]; int val[DIM]; int rank[DIM]; int idx; int flag; int flag2; class Obj *next; class Obj *prev; }; //simple list Obj *oHead=NULL; v</stdlib.h></stdio.h>…

#include <stdio.h> #include <stdlib.h> #define NDAT 10000000 #define DIM 3 class Obj { public: int val[DIM]; int rank[DIM]; int idx; int flag; int flag2; class Obj *next; class Obj *prev; }; //simple list Obj *oHead=NULL; void AddObj(Obj *o) { o->prev=NULL; </stdlib.h></stdio.h>…