Traversierung und Spannbäume

Description

13. Klasse Informatik (Datenstrukturen) Note on Traversierung und Spannbäume, created by Ann-Kathrine Buchmakowsky on 14/03/2020.
Ann-Kathrine Buchmakowsky
Note by Ann-Kathrine Buchmakowsky, updated more than 1 year ago
Ann-Kathrine Buchmakowsky
Created by Ann-Kathrine Buchmakowsky over 4 years ago
18
0

Resource summary

Page 1

Bäume

Pre-Order: public void preOrder(BinaryTree b) {    System.out.println(b.getContent());    if (b.getLeftTree != null) {       preOrder(b.getLeftTree());    }    if (b.getRightTree != null) {       preOrder(b.getRightTree());    } }

In-Order: public void inOrder(BinaryTree b) {    if (b.getLeftTree != null) {       inOrder(b.getLeftTree());    }     System.out.println(b.getContent());    if (b.getRightTree != null) {       inOrder(b.getRightTree());    } }

Post-Order: public void postOrder(BinaryTree b) {    if (b.getLeftTree != null) {       postOrder(b.getLeftTree());    }    if (b.getRightTree != null) {       postOrder(b.getRightTree());    }    System.out.println(b.getContent()); }

Page 2

Graphen

Algorithmus von Kruskal:  

Algorithmus von Prim:

Dijkstra-Algorithmus (Pseudo minimaler Spannbaum)

Show full summary Hide full summary

Similar

ein kleines Informatik Quiz
AntonS
Informatik
Tom Kühling
PHP Grundlagen
chrisi.0605
Wirtschaftsinformatik Teil 2
Sabrina Heckler
Informatik 1 - Einführung
Svenja
Codierung
Tom Kühling
Wirtschaftsinformatik Teil 1
Sabrina Heckler
Einführung in das Studium Informatik
Daniel Doe
Lernplan
Sandra K
Datenstrukturen
Ann-Kathrine Buchmakowsky