Trees/Operations Performance: Difference between revisions
From charlesreid1
| Line 22: | Line 22: | ||
===Traversing nodes=== | ===Traversing nodes=== | ||
[[ | [[Image:TreeTiming_Traverse.png|500px]] | ||
Revision as of 12:35, 12 June 2017
Tree class operations
This page covers performance tests of tree class operations and verification of their big-O performance.
LinkedBinTree
The process of building the linked binary tree class in Java was:
- Follow the Binary Trees class implementation laid out in Goodrich book, Chapter 8, Trees, in the Binary Trees/LinkedBinTree class: https://charlesreid1.com:3000/cs/java/src/master/trees/LinkedBinTree.java
- Build tests for the linked binary tree class in TreeTesting.java: https://charlesreid1.com:3000/cs/java/src/master/trees/TreeTesting.java
- Build timing scripts for the linked binary tree class in TreeTiming.java: https://charlesreid1.com:3000/cs/java/src/master/trees/TreeTiming.java
The timing script was used to perform verification that the amortized cost of the add and remove operations were as expected.
Adding nodes
Removing nodes
Traversing nodes
