For the follow ing 6 statements, fill in the best fit from a to k. 1.A linear list in sequential memory locations. 2.A linear list in which each node contains a link to the next node of the list. 3.A linear list for which all insertions and deletions(and usually all accesses)are made at one end of the list. 4.A linear list for which all insertions are made at one end of the list and all deletions(and usually all accesses)are made at the other end. 5.A linear list for which all insertions and deletions(and usually all accesses)are made at the ends of the list. 6.A list with an ordering that stores a set of data in a complete binary tree. a.1-D Array b.Buckets c.Deque d.Hash e.Heap f.1-D linked list g.Orthogonat linked list h.Ring i.stack J.Queue K.Binary Tree --

※ 发信站: 批踢踢实业坊(ptt.cc) ◆ From: 61.231.99.41