Date Night

Overview

Create a binary search tree to store movie names and their scores

Binary Search Tree: Intro

• Data structure
• Made of nodes
  • Element of data
  • Link to the left (value lower than current node)
  • Link to the right (value higher than current node)

Binary Search Tree: Example

Interaction Patterns: .new

tree = BinarySearchTree.new

Interaction Patterns: #insert

The insert method adds a new node with the passed-in data. Each node is comprised of a score and a movie title. It returns the depth of the new node in the tree.

tree.insert(61, "Bill & Ted's Excellent Adventure")
# => 0
tree.insert(16, "Johnny English")
# => 1
tree.insert(92, "Sharknado 3")
# => 1
tree.insert(50, "Hannibal Buress: Animal Furnace")
# => 2

Evaluation: Ruby Syntax & Style

• 4: Application demonstrates excellent knowledge of Ruby syntax, style, and refactoring
• 3: Application shows strong effort towards organization, content, and refactoring
• 2: Application runs but the code has long methods, unnecessary or poorly named variables, and needs significant refactoring
• 1: Application generates syntax error or crashes during execution

Evaluation: Breaking Logic into Components

• 4: Application is expertly divided into logical components each with a clear, single responsibility
• 3: Application effectively breaks logical components apart but breaks the principle of SRP
• 2: Application shows some effort to break logic into components, but the divisions are inconsistent or unclear
• 1: Application logic shows poor decomposition with too much logic mashed together

Evaluation: Test-Driven Development

• 4: Application is broken into components which are well tested in both isolation and integration using appropriate data
• 3: Application is well tested but does not balance isolation and integration tests, using only the data necessary to test the functionality
• 2: Application makes some use of tests, but the coverage is insufficient
• 1: Application does not demonstrate strong use of TDD

Evaluation: Functional Expectations

• 4: Application meets all requirements, and implements one extension properly.
• 3: Application meets all requirements as laid out per the specification.
• 2: Application runs, but does not work properly, or does not meet specifications.
• 1: Application does not run, crashes on start.