10
Trees
Objectives
An introduction to rooted and unrooted trees
An introduction to spanning trees
Code and data structures for representing trees
Code and data structures for representing binary trees
The heap structure as a tree structure
Preorder, postorder, and inorder traversal of a tree
Key Terms
ancestor of a node
balanced tree
binary tree
breadth-first search
breadth-first traversal
bush factor
children
complete binary tree
complete ternary tree
decision tree
depth-first search
depth-first traversal
depth of a node
embarrassingly parallel
greatest common divisor
heap
heap property
height-balanced
height of a binary tree
height of a node
inorder traversal ...
Get Data Structures Using Java now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
