[terminal] #include struct node { int data1, data2, level; struct node * right, * left; }* root, * temp; void inorder(struct node * p) { if (p != NULL) { inorder(p – > left); printf(“\t%d:%d “, p – > data1, p – > data2); inorder(p – > right); } } void postorder(struct node * p) … Continue reading C Implementation of K-dimensional Tree