--------------------------------------------------------------
------------------
------------------------------------------------------------------------------
-- Cheddar is a GNU GPL real time scheduling analysis tool.
-- This program provides services to automatically check performances
-- of real time architectures.
--
-- Copyright (C) 2002-2010,  by Frank Singhoff, Alain Plantec, Jerome Legrand
--
-- The Cheddar project was started in 2002 by
-- the LISyC Team, University of Western Britanny.
--
-- Since 2008, Ellidiss technologies also contributes to the development of
-- Cheddar and provides industrial support.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program 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 General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
--
--
-- Contact : cheddar@listes.univ-brest.fr
--
-----------------------------------------------------------------------------
-- Last update :
--    $Rev: 523 $
--    $Date: 2012-09-26 14:09:39 +0100 (Wed, 26 Sep 2012) $
--    $Author: fotsing $
------------------------------------------------------------------------------
------------------------------------------------------------------------------
generic
   type element is private;
   with procedure put (e : in element);

package binary_trees is

   no_cell : exception;

   type cell is private;
   type binary_tree is access cell;

   procedure add_left (l : in out binary_tree; e : in element);
   procedure add_right (l : in out binary_tree; e : in element);

   function get_left (l : in binary_tree) return binary_tree;
   function get_right (l : in binary_tree) return binary_tree;

   procedure put (l : in binary_tree);

   procedure delete (l : in out binary_tree; e : in element);

   procedure duplicate (src : in binary_tree; dest : in out binary_tree);

private

   type cell is record
      left, right : binary_tree;
      info        : element;
   end record;

end binary_trees;