Introduction to the Tree ADT.
Trees and Traversals
Textbook Exercises
An introduction to the Tree ADT.
screencast 17:15 min
My solution to quiz 17.
screencast 12:35 min
Binary Trees
Implementation of Binary Tree and Binary Search Tree.
screencast 22:45 min
My solution to quiz 18.
screencast 34:12 min
Huffman Trees
Introduction to Huffman Trees.
screencast 6:30 min
My solution to quiz 19.
screencast 9:30 min
Heaps and Priority Queues
Introduction and Implementation of a Heap and Priority Queue.
screencast 18:00 min
Write an in-order toString() method for a Binary Tree.
Practice
Write the find() method for a BinarySearchTree.
Write a pre-order toString() method for a Binary Tree.
Quiz
Write the insert(E e) method for a Binary Search Tree.
Write the insert() method for a BinarySearchTree.
Implement a BinarySearchTree and use it to sort Contacts.
Homework Assignment
Write the find(E e) method for an Array based Binary Search Tree.
Convert binary to hex and vise versa.
Implement Huffman encoding using a Huffman Tree.