data structures

The length of one sequential list is n. If we desire to insert a new element before tith e (Isin), how many element do we need to move? ( 2 points ) 3. (3 points The development process of data management technology includes , and (3) (2) 4. Draw pictures to represent a (circular linked list, doubly linked list) with nodes containing the integer values 1, 16, 27, 92. (6 points ) (8 points) 5. Please write down the outpat results the following function. vaid main Queue Q Init Queue(Q) Enter Queuer Q Enter Queuer Q, 'd' Enter Queue( Q.y; Delete Queuet Q. x) Enter Queue Q. x Delete Queuer Q x) Eater Queue Q. x'); printf( "%e", x ); 6. Answer the following questions about tree basic concepts (8 points) () The depth of the tree (2) The degree ofthe node D (3) The degree of the tree (4) The level of the node A