摘要：
这是爱立信发的编程题目（要求用ANSI C实现）： Youhavetodevelopasolutionforadynamictreeofobjectswithoutusingheapmemory(i.e.withoutusingmalloc/free).Asmemoryforyourdata,youaregivenastaticallyallocatedbufferofsomelengthN.Forthetreeyouhavetodesignthedatastructures,thetreestructureitselfhasonlyoneroot.Eachnodeofthetreemayh. 阅读全文
posted @ 2011-02-27 03:47
锐意
阅读(500)
评论(0)
推荐(0)
浙公网安备 33010602011771号