代码搜索：InitStack

找到约 954 项符合「InitStack」的源代码

代码结果 954
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/165768/10051992

cpp bitreemain.cpp

#include #include"head.h" void main() { BiTree pTree; InitBiTree(pTree); SqStack S2; InitStack(S2); cout
·
www.eeworm.com/read/161836/10366686

c function.c

#include #include #include"definition.h" int InitStack(SqStack *S) //创建一个空栈 { S->base=(int *)malloc( INIT_SIZE * sizeof(int) ); if(!S->base) //空间分配失败 return 1; //空间分配
·
www.eeworm.com/read/446574/7576567

c stack.c

#include "stdafx.h" Status InitStack(stack* s) { //构造一个空栈 s->base = (SElemType*) malloc(STACK_INIT_SIZE*sizeof(SElemType)); if(s->base==NULL) return ERROR; s->top = s->base ; //表示空栈 s->sta
·
www.eeworm.com/read/299227/7875042

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·
www.eeworm.com/read/240259/13228313

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·
www.eeworm.com/read/310200/13656091

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·
www.eeworm.com/read/212829/15148290

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·
www.eeworm.com/read/294906/3914717

c inordertraverse.c

Status InorderTraverse(BiTree T,Status(*Visit)(TElemType e)){ //中序遍历二叉树的非递归算法，对每个元素调用函数Visit InitStack(S); p = T; while(p || !StackEmpty(S)){ if(p){ Push(S,p); p = p->lchild; }
·
www.eeworm.com/read/360652/2960595

txt 算法 6.19.txt

算法 6.19 void HuffmanCoding( HuffmanTree HT, HuffmanCode &HC, int n ) { // 先序遍历赫夫曼树HT，求得树上n个叶子结点的编码存入HC Stack S; // 附设栈记路径 HC = new (char *)[n]; p = HC; InitStack(S);
·
www.eeworm.com/read/269229/11105104

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·