CS3 Coursenotes

Chapter 12 Week 14

| About   «  11.2. Tree Indexing   ::   Contents

12.1. General Trees

12.1.1. General Trees

12.1.2. General Tree ADT

12.1.3. General Tree Traversal

12.1.4. Representation: Lists of Children

The "list of children" implementation for general trees.

12.1.5. Representation: Dynamic Node (Array)

A dynamic general tree with fixed-size arrays

12.1.6. Representation: Dynamic Node (linked list)

A dynamic general tree with linked lists of child pointers

12.1.7. Representation: Left-Child/Right-Sibling

Converting from a forest of general trees to a binary tree

12.1.8. Serialization

  • Serialization is the process of storing an object as a series of bytes.

  • A sequential tree serialization typically stores the node values as they would be enumerated by a preorder traversal, along with sufficient information to describe the tree’s shape.

12.1.9. Binary tree serialization

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

12.1.10. Alternate serialization

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

12.1.11. Bit Vector Serialization

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

12.1.12. General Tree Serialization

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

   «  11.2. Tree Indexing   ::   Contents

Close Window