[問題] 東華資工資料結構考古題的題目
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年三年級轉學考的題目
小弟想了很久還是想不出來
(麻煩順便講一下大概題意...因為我不是很清楚)
有請資料結構高手來解答
感謝: )
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 219.71.211.97