Trees - "Tree" Structures - Study Guide This...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
"Tree" Structures - Study Guide
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This outline is intended to help you "skim" Chapter 7 Trees in the text book "Data Structures and Algorithms in Java". Tree structures are commonly used to represent an object. (An XML document, for example, or an arithmetic expression.) Java code is used to build a tree structure, and to traverse (process) a tree structure to lookup an object in the tree, or to calculate the expression that the tree represents. Page 266, figure 7.1 Think of the implementation of a tree structure as being like a LinkedList, where the previous field in a node points to the parent node, and the next field in the node is a (pointer to a) List of child nodes. The List may be ordered if that is meaningful. Page 269, figure 7.4 A Java class inheritance diagram is an example of a tree structure: The root node, at the top, has no parent, and is the Object class in Java. The
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Trees - "Tree" Structures - Study Guide This...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online