1. A+B n A+B B-A S+B
2. M minElem=a[row][0] N a[i][k] row
3. !father p->left p->right BSTree *root,int key return 0
4.temp=A[i] k>m A[i]=temp k小于m temp
6.Gpoint 0 points.length-1 getDitance(i,j) tmpDistance>shortestDistance
2. M minElem=a[row][0] N a[i][k] row
3. !father p->left p->right BSTree *root,int key return 0
4.temp=A[i] k>m A[i]=temp k小于m temp
6.Gpoint 0 points.length-1 getDitance(i,j) tmpDistance>shortestDistance