#ifndef BINARY_SEARCH_NODE_ITERATIVE
#define BINARY_SEARCH_NODE_ITERATIVE

#ifndef nullptr
#define nullptr 0
#endif

#include <cassert>
#include "Exception.h"

template <typename Type>
class Binary_search_tree;

template <typename Type>
class Binary_search_node {
	private:
		Type element;
		Binary_search_node *left_tree;
		Binary_search_node *right_tree;

	public:
		Binary_search_node( Type const & );

		Type retrieve() const;
		Binary_search_node *left() const;
		Binary_search_node *right() const;
		bool is_leaf() const;

	friend class Binary_search_tree<Type>;
};

template <typename Type>
Binary_search_node<Type>::Binary_search_node( Type const &obj ):
element( obj ),
left_tree( nullptr ),
right_tree( nullptr ) {
	// empty
}

template <typename Type>
Type Binary_search_node<Type>::retrieve() const {
	return element;
}

/*
 *  Binary_search_node *left() const
 *  Binary_search_node *right() const
 *
 *  Returns the addresses of the left and right sub-trees, respectively.
 */

template <typename Type>
Binary_search_node<Type> *Binary_search_node<Type>::left() const {
	return left_tree;
}

template <typename Type>
Binary_search_node<Type> *Binary_search_node<Type>::right() const {
	return right_tree;
}

/*
 *  bool is_leaf() const
 *
 *  A node is a leaf node if both its sub-trees are empty.
 */

template <typename Type>
bool Binary_search_node<Type>::is_leaf() const {
	return ( left() == nullptr ) && ( right() == nullptr );
}

#endif