茶向

http://www.cnblogs.com/huangxincheng/category/340146.htmlhttp://blog.youkuaiyun.com/feixiaoxing/article/category/878822/1

// DesignPattern.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include "Test.h"#include #include #include using namespace std;typedef struct node{ int dat

你要伪码我就帮你弄伪码不过要用到两个函数int Depth(BiTree T)/* 深度 */ { if(T==NULL) return(0); return 1+(Depth(T->lchild)>Depth(T->rchild)? Depth(T->lchild):Depth(T->rchild)); //选择左右孩子深度高的然后加上根节点这一层就是深度了}v

// Test.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include #include using namespace std;struct BinaryNode{ char str; BinaryNode * leftNode; BinaryNode * rightNode;};// 先序的起始字符，为分割中序字符串的字

void Merge(int* array, int* tempararay, int left, int middle, int right){ int leftstart = left; int rightstart = middle-1; int tempIndex = leftstart; while(leftstart<rightstart) { if(array[lef

int QuickSort(int a[], int low, int high){ int temp = a[low]; while(low <high) { while(low<high && a[low] < temp) { low++; } temp = a[low]; while(low temp) { high--; } temp =