{"id":354,"date":"2023-01-10T09:30:00","date_gmt":"2023-01-10T09:30:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=354"},"modified":"2022-12-20T10:43:29","modified_gmt":"2022-12-20T09:43:29","slug":"vorlesung-16","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-16\/","title":{"rendered":"Vorlesung 16"},"content":{"rendered":"\n
In dieser Vorlesung geben wir einen \u00dcberblick \u00fcber einige weitere dynamische Datenstrukturen wie Rot-Scharz-B\u00e4umme, B-B\u00e4ume und Heaps.<\/p>\n\n\n\n
Folien: VL16.pdf<\/a> Wikipedia \u00fcber Rot-Schwarz-B\u00e4ume<\/a> In dieser Vorlesung geben wir einen \u00dcberblick \u00fcber einige weitere dynamische Datenstrukturen wie Rot-Scharz-B\u00e4umme, B-B\u00e4ume und Heaps.<\/p>\n","protected":false},"author":1,"featured_media":355,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"","footnotes":""},"categories":[6,13],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_.png",1024,403,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-150x150.png",150,150,true],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-300x118.png",300,118,true],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-768x302.png",768,302,true],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_.png",1024,403,false],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_.png",1024,403,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_.png",1024,403,false]},"uagb_author_info":{"display_name":"Matthias Konitzny","author_link":"https:\/\/aud.ibr.cs.tu-bs.de\/author\/konitzny\/"},"uagb_comment_info":0,"uagb_excerpt":"In dieser Vorlesung geben wir einen \u00dcberblick \u00fcber einige weitere dynamische Datenstrukturen wie Rot-Scharz-B\u00e4umme, B-B\u00e4ume und Heaps.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/354"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/comments?post=354"}],"version-history":[{"count":4,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/354\/revisions"}],"predecessor-version":[{"id":948,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/354\/revisions\/948"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/355"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=354"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=354"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=354"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Video: [YouTube]<\/a>, [IBR]<\/a>
Quiz: [pdf]<\/a><\/p>\n\n\n\nWeitere Links<\/h3>\n\n\n\n
Einf\u00fcgen in Rot-Schwarz-B\u00e4ume<\/a>
L\u00f6schen aus Rot-Schwarz-B\u00e4umen<\/a>
Wikipedia \u00fcber B-B\u00e4ume<\/a>
Einf\u00fcgen in B-B\u00e4ume<\/a>
L\u00f6schen aus B-B\u00e4umen<\/a>
Wikipedia \u00fcber Heaps<\/a>
Wikipedia \u00fcber Speicherhierarchien<\/a>
Homepage von Erik Demaine<\/a>
Homepage von Michael Bender<\/a>
Animation diverser Algorithmen und Datenstrukturen<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"