1.采用链式结构实现任意多项式的存储，求两个多项式的和。

2.假设自上而下按层次，自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素，P为其父结点，L指示D为P 的左孩子，R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。

3.采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storage, and the sum of two polynomials. 2 Assuming a hierarchical top-down, from left to right input of each node a triple (D, P, L/R). Where D is an element node, P is the parent node, L indicates D is the left child of P, R indicates D is P' s right child. Try to write a binary tree in memory to establish a double-stranded representation algorithm and achieve first root, the root, root, and layer after traversal algorithms. 3 using adjacency matrix used to achieve network storage, to establish a network and to achieve single-source shortest path algorithm.