JessyGreben

require 'trie'

class LongestConcatWord
	def initialize(file)
		@trie = Trie.new
		@word_hash = Hash.new
		@original_word = nil
		@file = file
		@concat_words = []
		@count = 0

JessyGreben

class Node 
  attr_reader :value
  attr_accessor :left, :right

  def initialize(value=nil)
	  @value = value
	  left = nil;
	  right = nil;
  end
end

JessyGreben

var BinarySearchTree = function() {
  this.root = null;
};

//build a tree
BinarySearchTree.prototype.insert = function(value) {
  
  //create a node object with the data as value
  var node = {
    value: value,

JessyGreben

=Navigating=
    visit('/projects')
    visit(post_comments_path(post))

=Clicking links and buttons=
    click_link('id-of-link')
    click_link('Link Text')
    click_button('Save')
    click('Link Text') # Click either a link or a button
    click('Button Value')