第一条：
(1) using array or link structure to implement the polynomial’s ADD operation.
State clearly the implementation and its time complexity.
(2) Stack can be used to convert infix expression to postfix expression. You are required to finish following:
a. Implement a stack and its PUSH / POP operations; state clearly its implementation.
b. Operation of converting infix to postfix, state its time complexity.
c. calculate the value of the postfix expression with your implementation, state its time complexity.
第二条：
(1) Prove that for any nonempty binary tree, n0 = n2 + 1 where n0 is the number of leaf nodes and n2 the number of nodes of degree 2.
(2) Using linked representation following to create a binary tree. The program you implemented should accept the data to ‘data’ field from input.
typedef struct node *tree_ptr;
typedef struct node
{
int data;
tree_ptr left_child,right_child;
}
Implement the program of inorder traversal, preorder traversal and postorder traversal. And analyze their time complexity.
(3) Consider a message comprised only of the following symbols: {C, A, T, P}, assume message is: CCT PAT TTP CTP CPA, use the Huffman algorithm to encode the symbols by frequency.
Implement the program to create this tree[
求各位大大帮帮忙！快死人了！
做好了在QQ找我！两道题做了再然后写个流程图！就那么简单！谢谢各位大大！QQ：81496565~ 我会在网上银行汇款交易！谢谢！广州的可以电话联系！13560362057，小姓黎！

是什么程序啊？

第一条:(1)利用数组或结构连接多项式实施的补充行动. 明确实施时间和复杂性.
(2)栈可以用来转换附和表达Postfix的表达方式.
你必须完成如下:
甲. 栈及其实施推/流行业务; 明确其执行.
乙. 转换到Postfix的运行附和,其时间复杂状态.
三 计算值表达你的Postfix的执行,其时间复杂状态.

第二条:(1)证明对任何非空二叉树, N0期=1+氮气N0期那里有多少节点和叶节点数目氮气 2度.
(二)利用任职挂钩以下营造二叉树. 实施<纲要>你应该接受数据的数据'来自外地输入.
typedeftree_ptr*构造节 点; 陈春*typedef构造节点数据;
tree_ptrleft_child,right_child;3195 落实<纲要要使遍历、 订单遍历和后序遍历. 并分析其时间复杂.
(3)只考虑了一个信息包含以下符号:
陈春三,一、笔、磷3195、负的讯息是: 八罪案制版国泰TTP问题,用霍夫曼算法编码的符号频率.
实施纲要创造这棵树[

是这样么？？？？？？？？？？？？？？？？？？？