1. Trees > 
  2. Introduction to Trees > 
  3. MyTree I > 
  4. Tree UML videos

Tree UML videos

Pseudocode

Adding Children

Removing Children

6.0.0

Last modified by: Emily Alfs Oct 26, 2021

Computational Core Logo

  • 0 Introductory Material
    • 1. CC 315 Syllabus
  • I Strings and StringBuilders
    • 1 Strings and StringBuilders
      • 1. Introduction
      • 2. Theory
      • 3. Memory Example
      • 4. Limitations Java
      • 5. Limitations Python
      • 6. Summary
  • II Trees
    • 2. Introduction to Trees
      • 1. Introduction
      • 2. General Terms
      • 3. What Makes a Tree a Tree
      • 4. MyTree I
        • 5. Tree UML videos
      • 5. Summary
    • 3. Tree Traversal
      • 1. Introduction
      • 2. Terms I
      • 3. Recursion Refresh
      • 4. Terms II
      • 5. Terms III
      • 6. MyTree Recursive I
      • 7. MyTree Recursive II
      • 8. MyTree Recursive III
      • 9. Summary
    • 4. Tries
      • 1. Tries
      • 2. Trie Example
      • 3. MyTrie I
      • 4. MyTrie II
    • 5. Binary Trees
      • 1. Binary Tree
      • 2. Binary Tree Examples
      • 3. Traversals
      • 4. In-Order Traversal
      • 5. MyBinaryTree
      • 6. Inserting Children
      • 7. Removing Children
      • 8. Balance
  • Iii-Graphs
    • 6. Graphs: Matrix Representation
      • 1. Introduction
      • 2. Terms I
      • 3. Graph Features
      • 4. Weighted Graphs
      • 5. Directed Graphs
      • 6. Example
      • 7. Matrix Representation
      • 8. UML
      • 9. Node and Edge Functions
      • 10. Summary
    • 7. Graphs: List Representation
      • 1. Introduction
      • 2. List Representation
      • 3. Dense VS Sparse
      • 4. UML - Graph Node
      • 5. UML - Graph
      • 6. Node and Edge Functions
      • 7. Summary
    • 8. Graphs: Searching and Traversing
      • 1. Introduction
      • 2. Depth First
      • 3. Breadth First
      • 4. Limitations
      • 5. Finding a Path
      • 6. In Practice
    • 9. Graphs: Minimum Spanning Trees
      • 1. Introduction
      • 2. Minimum Spanning Trees
      • 3. Kruskal
      • 4. Prim
      • 5. Traveling Salesperson
  • Iv-Priority-Queues
    • 10. Heaps and Priority Queues
      • 1. Introduction
      • 2. Node Relationships
      • 3. Priority Queues
      • 4. Functionality
      • 5. Dijkstras
  • V-Requirements-Analyses
    • 11. Performance
      • 1. Module Outline
      • 2. Trees
      • 3. Graphs
      • 4. Priority Queues
      • 5. 315 Structure Performance Summary
      • 6. Tree Algorithms
      • 7. Graph Algorithms
      • 8. 310 Structure Performance Summary
    • 12. Requirements Analysis
      • 1. Module Outline
      • 2. Types of Data
      • 3. Trees
      • 4. Graphs
      • 5. Priority Queues
      • 6. Examples
  • Z-Instructor-Resources

  •  
  •  
  •  

Built using Hugo and Hugo Relearn Theme.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. See License & Attribution for details.