I have some questions about data structure, please help me solve these problems with pseudo-code, thanks a lot! : 1.Describe an efficient data structure for implementing the "bag" ADT, which supports a method add(e), for adding an element e to the bag, and a method remove(), which removes an arbitrary element in the bag. Show that both of these methods can be done in O(1) time. 2.Give the pseudo-code description for performing a removal from a hash table that uses linear probing to resolve collisions where we don't use a special marker to represent deleted elements. That is, we must rearrange the contents of the hash table so that it appears that the removed entry was never inserted in the first place. 3.Let T and U be (2,4) trees storing n and m entries, respectively, such that all the entries in T have keys less than the keys of all the entries in U. Describe an O(logn logm) time method for joining T and U into a single tree that stores all the entries in T and U. 我是趙婷

------
我是趙婷

你這個應該是資料結構的習題之類的吧，如果看課本還是不知道怎麼寫的話去Google找找看吧，如果是習題應該都可以找到答案，當然，如果想要增進自己的實力，你還是自己看看書，試試看能不能寫出來