GDL's BLOG

Java版public class InsertionSort { public static void main(String[] args) { int[] a = { 15, 25, 77, 1, 56, 4, 7, 6 }; for (int i = 0; i < a.length; i++) { System.out.print(

二叉树结构体定义 typedef struct TreeNode *BinTree struct TreeNode{ ElementType Data; BinTree Left; BinTree Right; } 遍历函数 void PreOrderTraversal( BinTree BT )：先序----根、左子树、右