Q1:What are the minimum and maximum numbers of elements in a heap of hight h?
Q2:Assume we have two linked lists with first node pointed by head1 and head2
respectively. What would happen if we applied head1=head2 to these two lists?
Q3:Write a pseudo code that traverses a linked list and delete all nodes whose
keys are negative.
以上三题是东华资工96年和98年三年级转学考的题目
小弟想了很久还是想不出来
(麻烦顺便讲一下大概题意...因为我不是很清楚)
有请资料结构高手来解答
感谢: )