Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:...nearly complete binary tree?In Reply To:...nearly complete binary tree? Posted by:ahyangyi at 2007-04-01 15:48:39 in this problem a heap is defined/constructed upon an ordinary array in the most common way > is this a valid input? > > 4 > 1 > 5 3 > 4 5 9 2 > 3 5 6 > > does the heap in this problem just look like common heaps (the number of keys in the last line can be less than 2^(n-1)) ? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator