13.2. Trees¶
13.2.1. Objectives¶
Describe the Tree ADT, and the characteristics of a Tree and a Binary Tree
Define Tree terminology including - node, root, edge, parent, child, sibling, leaf, height, level
Traverse a given Tree using Inorder, Preorder, Postorder, and Level order
Determine the height and number of nodes of a given Tree
Implement a Tree ADT as a recursive data structure
13.2.1.1. Suggested Reading¶
Chapter 23 Trees & Chapter 24 Tree Implementations from Data Structures and Abstractions with Java, 4th edition by Frank M. Carrano and Timothy Henry
13.2.2. Interactive: Introduction to Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
TreeIntro.pdf
13.2.3. Checkpoint 1¶
13.2.4. Interactive: Binary Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
BinaryTrees.pdf
13.2.5. Checkpoint 2¶
13.2.6. Interactive: Binary Tree Traversals¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
IntroToTraversals.pdf
13.2.7. Checkpoint 3¶
13.2.8. Interactive: Programming Binary Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
ProgrammingTrees.pdf