sttree.phead, 7);
499 ? ? testtree.add(&testtree, testtree.phead, 8);
500 ? ? testtree.add(&testtree, testtree.phead, 11);
501 ? ? testtree.add(&testtree, testtree.phead, 10);
502?
503 ? ? testtree.pre_traverse(&testtree, testtree.phead);
504 ? ? printf("\n");
505 ? ? testtree.mid_traverse(&testtree, testtree.phead);
506 ? ? printf("\n");
507 ? ? testtree.last_traverse(&testtree, testtree.phead);
508 ? ? printf("\n");
509?
510 ? ? printf("%d\n", (testtree.search(&testtree, testtree.phead, 8))->data);
511 ? ? printf("\n");
512?
513 ? ? testtree.del(&testtree, &testtree.phead, 4);
514 ? ? testtree.del(&testtree, &testtree.phead, 1);
515 ? ? testtree.del(&testtree, &testtree.phead, 6);
516 ? ? testtree.alter(&testtree, testtree.phead, 9, 2);
517?
518 ? ? testtree.pre_traverse(&testtree, testtree.phead);
519 ? ? printf("\n");
520 ? ? testtree.mid_traverse(&testtree, testtree.phead);
521 ? ? printf("\n");
522 ? ? testtree.last_traverse(&testtree, testtree.phead);
523 ? ? printf("\n");
524?
525 ? ? return 0;
526 }