Ben Harrison, bharrison

Favorite Pizzas

  1. Peperoni
  2. Sausage
  3. Hawaiian

Classes next Semester

Picture of Quanta on her 15th Birthday

Quanta Quinceañera

Exam Schedule

Class Day Time
Stat 234 05/05 7:25
GeoSci 100 05/05 12:25
CompSci 400 05/10 5:05
PoliSci 231 05/10 12:25

CS400 terms

Binary Search Tree
A Binary Search Tree is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with keys lesser than the node’s key. The right subtree of a node contains only nodes with keys greater than the node’s key. The left and right subtree each must also be a binary search tree.
AVL Tree
an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property.
a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children.

Change background button

Second Page

Go To Page 2