Data Structures

Authors: Morgan Nomura and Sean Beseler

All modules and tests located in src directory.

Binary Search Tree

Self-balancing binary search tree using AVL balancing.

• module: bst.py
• test: test_bst.py
• methods:
  • size: Return number of nodes in binary search tree.
  • balance: Return difference between left and right balance.
  • depth: Return the max depth of the binary search tree.
  • search: Search for a value and return a node if found.
  • contains: Evaluate whether a value is in a binary search tree.
  • insert: Insert a new value into binary search tree.
  • breadth_first: sort bst breadth first.
  • pre_order: sort bst by pre-order.
  • in_order: sort bst in order.
  • post_order: post order sort of bst.