2014年08月_INGNIGHT

11月 10月 09月 08月 07月

原创树的非递归（前序，中序，后序）

#include #include typedef struct _Tree { int nValue; struct _Tree* pLeft; struct _Tree* pRight; }Tree; // 树的节点 void CreateTree(Tree* *tree) { (*tree) = (Tree*)malloc(sizeof(Tree))

2014-08-28 19:49:00 473

原创树的层遍历

#include #include typedef struct _Tree { int nValue; struct _Tree* pLeft; struct _Tree* pRight; }Tree; // 树的节点 void CreateTree(Tree* *tree) { (*tree) = (Tree*)malloc(sizeof(Tree))

2014-08-28 19:45:17 412

原创树的队列广度遍历

#include #include typedef struct _Tree { int nValue; struct _Tree* pLeft; struct _Tree* pRight; }Tree; void CreateTree(Tree* *tree) { (*tree) = (Tree*)malloc(sizeof(Tree)); (*tree)-

2014-08-28 19:30:21 418

原创树的递归遍历（前序，中序，后序）

#include #include typedef struct _Tree { int nValue; struct _Tree* pLeft; struct _Tree* pRight; }Tree; void CreateTree(Tree* *tree) { (*tree) = (Tree*)malloc

2014-08-28 18:31:22 439

原创两个栈实现队列

#include #include typedef struct _Stack { int nValue; struct _Stack* pNext; }Stack; typedef struct _Queue { Stack* pTopOne; Stack* pTopTwo; }Queue; void PushStack(Stack** pTop,i

2014-08-26 21:34:10 295

原创队列

#include #include typedef struct STACK { int nValue; struct STACK *next; }stack; stack *pTopOne=NULL; stack *pTopTwo=NULL; void pushStack(stack **pTop,int nValue) { stack *temp=(stack *)

2014-08-21 12:38:09 289

转载贪吃蛇

#include #include #include using namespace std; //------豆的结构体------ typedef struct BeanNode { int x; int y; }BeanNode; //------蛇的结构体------ typedef struct snakeNode { int x; int y;

2014-08-05 13:10:32 425

原创 WINDOWs

#include #include"resource.h" LRESULT __stdcall wndProc(HWND hWnd, UINT msg, WPARAM wParam, LPARAM lParam); int WINAPI WinMain( HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, in

2014-08-01 09:08:54 370