/*
 * <one line to give the library's name and an idea of what it does.>
 * Copyright (C) 2013  <copyright holder> <email>
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 * 
 */

#pragma once

#include "../tree_binary.hpp"
#include "../../error.hpp"

namespace tree {

data_t& BinaryTree::find(key_t key) {
    if(root_.empty()) {
      throw not_found_exception(key);
    }
    
    element_t* tmp_element = &root_;
    do {
      if(tmp_element->key() < tmp_element->left()->key()) {
	tmp_element = tmp_element->left();
      } else {
	tmp_element = tmp_element->right();
      }
    } while(tmp_element->is_not_leaf());
    
    if(tmp_element->key() == key) {
      return tmp_element->data();
    } else {
      throw not_found_exception(key);
    }
}

bool BinaryTree::insert(key_t key, data_t& data) noexcept {
  if(root_.empty()) {
    root_.set_key(key);
    root_.set_data(data);
    return true;
  }
  
  element_t* tmp_element = &root_;
  while(tmp_element->is_not_leaf()) {
    if(tmp_element->key() < key) {
      tmp_element = tmp_element->left();
    } else {
      tmp_element = tmp_element->right();
    }
  }
  
  if(tmp_element->key() == key) {
    return false;
  }
    
  element_t* old_element = new element_t(*tmp_element);
  element_t* new_element = new element_t(key, data);
  
  if(tmp_element->key() < key) {
    tmp_element->set_left(old_element);
    tmp_element->set_right(new_element);
    tmp_element->set_key(key);
  } else {
    tmp_element->set_left(new_element);
    tmp_element->set_right(old_element);
  }
  
  return true;
}

} // end tree namespace