1 / 5

アルゴリズムの設計と解析

アルゴリズムの設計と解析. 黄　潤和、佐藤　温（ TA ） 2012.4 ～. Contents (L5 – Red-Black trees ). Lecture notes given by MIT, MIT-RBT-lec10-ppt.pdf (note: Thanks for MIT’s excellent video lecture content). Home work. Watch MIT video lecture, http://videolectures.net/mit6046jf05_demaine_lec10/

ray-weaver
Download Presentation

アルゴリズムの設計と解析

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. アルゴリズムの設計と解析 黄　潤和、佐藤　温（TA） 2012.4～

  2. Contents (L5 – Red-Black trees) Lecture notes given by MIT, MIT-RBT-lec10-ppt.pdf (note: Thanks for MIT’s excellent video lecture content)

  3. Home work Watch MIT video lecture, http://videolectures.net/mit6046jf05_demaine_lec10/ Read its text in English, MIT-RBT-lect10-ppt-En.pdf

  4. Exercise 5-1 Consider the following sequence of keys: (18, 30, 25, 12, 14). Insert the items with this set of keys in the order given into the red-black tree below. Draw the tree after each insertion. キー配列について考える: (18, 30, 25, 12, 14)。 このキーのセットを図の赤黒木に挿入しなさい。 それぞれの挿入後の赤黒木を描きなさい。

More Related