5 Commits

Author SHA1 Message Date
0bc2b9690f
8.9 Lab: BT <--- BST (Indented Tree)
Write a variation of one of the Depth-First Traversal Functions named printTree that displays the indented tree, including the level numbers.
2024-05-03 14:00:39 -07:00
8e55246e9c
8.8 Lab: BT <--- BST (Smallest/Largest)
The assignment consists of the following classes/files:

- BinaryNode.h (template, given)
- BinaryTree.h (template, incomplete)
- BinarySearchTree.h(template, incomplete)
- main.cpp (incomplete)

Write the following functions:

- findSmallest (recursive)
- findLargest (recursive)
2024-05-03 13:15:46 -07:00
2ff40ef4e9
8.7 Lab: BT <--- BST (Traversals) 2024-05-03 13:02:04 -07:00
41c45e09fb
8.4 Lab: BT - Traversals (in-, post-, and pre-Order) - Version 2 2024-05-03 12:34:37 -07:00
6f5d2f2d5e
8.3 Lab: BT - Traversals (in-, post-, and pre-Order) 2024-05-02 17:34:56 -07:00