[求助]两条简单的程序…100块
第一条：<BR>(1) using array or link structure to implement the polynomial’s ADD operation.<BR>State clearly the implementation and its time complexity.<BR>(2) Stack can be used to convert infix expression to postfix expression. You are required to finish following:<BR>a. Implement a stack and its PUSH / POP operations; state clearly its implementation.<BR>b. Operation of converting infix to postfix, state its time complexity.<BR>c. calculate the value of the postfix expression with your implementation, state its time complexity.<BR>第二条：<BR>(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.<BR>(2) Using linked representation following to create a binary tree. The program you implemented should accept the data to ‘data’ field from input.<BR>typedef struct node *tree_ptr;<BR>typedef struct node <BR>{<BR> int data;<BR> tree_ptr left_child,right_child;<BR>}<BR>Implement the program of inorder traversal, preorder traversal and postorder traversal. And analyze their time complexity.<BR>(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.<BR>Implement the program to create this tree[<BR>求各位大大帮帮忙！快死人了！<BR>做好了在QQ找我！两道题做了再然后写个流程图！就那么简单！谢谢各位大大！QQ：81496565~ 我会在网上银行汇款交易！谢谢！广州的可以电话联系！13560362057，小姓黎！页:
[1]