請益一下,二元搜尋找到最大值,可以使用以下範例去證明之嗎。說明根的特性。 int left_child(int index) {return index * 2;} int right_child(int index) {return index * 2 + 1;} void binary_tree() { int tree[5 + 1]; cout ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 114.39.12.135※ 文章網址: http://www.ptt.cc/bbs/Examination/M.1396415061.A.954.html
This entry passed through the Full-Text RSS service — if this is your content and you're reading it on someone else's site, please read the FAQ at fivefilters.org/content-only/faq.php#publishers.
You are receiving this email because you subscribed to this feed at blogtrottr.com.