代码搜索结果

// c6-6.h 二叉树的三叉链表存储表示 typedef struct BiTPNode { TElemType data; BiTPNode *parent,*lchild,*rchild; // 双亲、左右孩子指针 }BiTPNode,*BiPTree;

/* bo6-6.c 二叉树的三叉链表存储(存储结构由c6-7.h定义)的基本操作(21个) */ Status InitBiTree(BiPTree *T) { /* 操作结果: 构造空二叉树T */ *T=NULL; return OK; } void DestroyBiTree(BiPTree *T) { /* 初始条件: 二叉树T存在。操作结果:

/* c6-6.h 二叉树的三叉链表存储表示 */ typedef struct BiTPNode { TElemType data; struct BiTPNode *parent,*lchild,*rchild; /* 双亲、左右孩子指针 */ }BiTPNode,*BiPTree;

/* main6-6.c 检验bo6-6.c的主程序 */ #define CHAR /* 字符型 */ /*#define INT /* 整型（二者选一） */ #include"c1.h" #ifdef CHAR typedef char TElemType; TElemType Nil=' '; /* 字符型以空格符为空 */ #endif #ifd

#include using namespace std; int main() {void select_sort(int *p,int n); //函数声明 int a[10],i; double c=3.6,*q=&c; cout

#include using namespace std; int main() {int length(char *p); int len; char str[20]; coutstr; len=length(str); cout

% Program 6_6 % FIR Cascaded Lattice Realization % format long num = input('Transfer function coefficients = '); k = tf2latc(num); disp('Lattice coefficients are'); disp(fliplr(k)');

% Program 6_6 % Power Series Expansion of a Rational z-Transform % % Read in the number of inverse z-transform coefficients % to be computed N = input('Type in the length of output vector = ');

G=tf([5,5],[1,4,2,3,0]); t=[0:0.1:150]'; u=sin(t+pi/6); lsim(G,u,t) ; title('正弦信号输出响应曲线'); xlabel('t'); ylabel('sin(t+pi/6)'); grid