Data Structures and Algorithms Lecture Notes

23 March 2011 • Trees


Outline

  • Motivation
  • Tree properties.
  • Tree data structures.
  • Tree implementations.
  • Extension and details.
a tree

Linked Lists Again

Fast Interior Access

Fast-Access Structure

Trees

Node Relations

Tree Properties

The Tree Date Type

Implementing Trees

Tree Data-Type Data

Dynamic Implementation

Trees And Recursion

Binary Tree Operations

Binary-Tree Search

Binary-Tree Add

Removing Nodes

Removing Leaves

Removing Almost Leaves

Removing Any Node

Binary-Tree Remove

Operation Performance

Tree Traversals

Traversal Actions

Traversal Types

Traversal Example

Implementing Traversals

Summary

References

Credits


This page last modified on 2010 March 25.

Creative
    Commons License