{"id":73,"date":"2020-10-02T12:30:52","date_gmt":"2020-10-02T10:30:52","guid":{"rendered":"http:\/\/aud.ibr.cs.tu-bs.de\/?page_id=73"},"modified":"2021-09-24T18:50:50","modified_gmt":"2021-09-24T16:50:50","slug":"kapitel-4-dynamische-datenstrukturen","status":"publish","type":"page","link":"https:\/\/aud.ibr.cs.tu-bs.de\/kapitel\/kapitel-4-dynamische-datenstrukturen\/","title":{"rendered":"Kapitel 4 &#8211; Dynamische Datenstrukturen"},"content":{"rendered":"\n<p>Datenstrukturen erm\u00f6glichen die effzientere Umsetzung von Algorithmen und den schnelleren Zugriff auf Informationen. In diesem Kapitel betrachten wir Aufgabenstellungen, die sich aus der dynamischen Verwaltung von Daten ergeben, die sich insbesondere durch Einf\u00fcgen und L\u00f6schen ergeben.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Vorlesungen<\/h2>\n\n\n<ul class=\"wp-block-latest-posts__list has-dates wp-block-latest-posts\"><li><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/grosse-uebung-10-fragestunde\/\">Gro\u00dfe \u00dcbung 9 &#8211; Fragestunde<\/a><time datetime=\"2023-02-09T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">9. Februar 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Quiz und ganz viel aus der Vorlesung!<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"118\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-300x118.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-300x118.png 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-768x302.png 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_-816x321.png 816w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-B-Baum.svg_.png 1024w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-16\/\">Vorlesung 16<\/a><time datetime=\"2023-01-10T09:30:00+01:00\" class=\"wp-block-latest-posts__post-date\">10. Januar 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung geben wir einen \u00dcberblick \u00fcber einige weitere dynamische Datenstrukturen wie Rot-Scharz-B\u00e4umme, B-B\u00e4ume und Heaps.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"217\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/U5-300x217.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/U5-300x217.png 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/U5-768x556.png 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/U5-816x591.png 816w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/U5.png 1007w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/uebung-5\/\">\u00dcbung 5<\/a><time datetime=\"2022-12-22T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">22. Dezember 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser \u00dcbung betrachten wir noch einmal verschiedene Aspekte von Datenstrukturen und stellen \u00dcberlegungen an, wie die Auswahl von Datenstrukturen die Laufzeit von Algorithmen beeinflussen kann.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"218\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/balance-300x218.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/balance-300x218.png 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/balance-768x559.png 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/balance-816x594.png 816w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/balance.png 824w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-15\/\">Vorlesung 15<\/a><time datetime=\"2022-12-21T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">21. Dezember 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung besch\u00e4ftigen wir uns mit dem Erhalt der AVL-Eigenschaft eines bin\u00e4ren Suchbaumes bei Einf\u00fcge- und L\u00f6schoperationen. Au\u00dferdem werfen wir einen Blick auf die Fibonacci-Zahlen.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"237\" height=\"152\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/AVL-tree-wBalance_K.svg_.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-14\/\">Vorlesung 14<\/a><time datetime=\"2022-12-20T09:30:00+01:00\" class=\"wp-block-latest-posts__post-date\">20. Dezember 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung besch\u00e4ftigen wir uns mit speziellen bin\u00e4ren Suchb\u00e4umen, den AVL-B\u00e4umen und ihren Eigenschaften.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"169\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-300x169.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-300x169.jpg 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-768x432.jpg 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-816x459.jpg 816w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide.jpg 960w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/uebung-4\/\">\u00dcbung 4<\/a><time datetime=\"2022-12-15T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">15. Dezember 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser \u00dcbung schauen wir uns eine Beweistechnik an: die vollst\u00e4ndige Induktion.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"286\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/binary-300x286.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/binary-300x286.png 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/binary-768x731.png 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/binary.png 788w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-13\/\">Vorlesung 13<\/a><time datetime=\"2022-12-14T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">14. Dezember 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung  werden bin\u00e4re Suchb\u00e4ume und die bin\u00e4re Suche behandelt.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"196\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565-300x196.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565-300x196.jpg 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565-1024x668.jpg 1024w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565-768x501.jpg 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565-1536x1001.jpg 1536w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565-816x532.jpg 816w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/12\/Screenshot_2020-12-09-VL12-VL12-pdf-e1607510621565.jpg 1836w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-12\/\">Vorlesung 12<\/a><time datetime=\"2022-12-13T10:23:16+01:00\" class=\"wp-block-latest-posts__post-date\">13. Dezember 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung beginnen wir dynamische Datenstrukturen einzuf\u00fchren. Es werden Stapel, Warteschlangen und verkettete Listen vorgestellt.<\/div><\/li>\n<\/ul>","protected":false},"excerpt":{"rendered":"<p>Datenstrukturen erm\u00f6glichen die effzientere Umsetzung von Algorithmen und den schnelleren Zugriff auf Informationen. In diesem Kapitel betrachten wir Aufgabenstellungen, die sich aus der dynamischen Verwaltung von Daten ergeben, die sich \u00a0\u2026 <a href=\"https:\/\/aud.ibr.cs.tu-bs.de\/kapitel\/kapitel-4-dynamische-datenstrukturen\/\" rel=\"noopener noreferrer\">Weiterlesen<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":30,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","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":""},"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":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":"Datenstrukturen erm\u00f6glichen die effzientere Umsetzung von Algorithmen und den schnelleren Zugriff auf Informationen. In diesem Kapitel betrachten wir Aufgabenstellungen, die sich aus der dynamischen Verwaltung von Daten ergeben, die sich \u00a0\u2026 Weiterlesen","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/73"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/types\/page"}],"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=73"}],"version-history":[{"count":12,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/73\/revisions"}],"predecessor-version":[{"id":704,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/73\/revisions\/704"}],"up":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/30"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=73"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}