Binary_Tree.h

Go to the documentation of this file.

/* ############################ MALP License ############################## */
/* # Fri Jan 18 14:00:00 CET 2013                                         # */
/* # Copyright or (C) or Copr. Commissariat a l'Energie Atomique          # */
/* #                                                                      # */
/* # This software is governed by the CeCILL-C license under French law   # */
/* # and abiding by the rules of distribution of free software.  You can  # */
/* # use, modify and/ or redistribute the software under the terms of     # */
/* # the CeCILL-C license as circulated by CEA, CNRS and INRIA at the     # */
/* # following URL http://www.cecill.info.                                # */
/* #                                                                      # */
/* # The fact that you are presently reading this means that you have     # */
/* # had knowledge of the CeCILL-C license and that you accept its        # */
/* # terms.                                                               # */
/* #                                                                      # */
/* # Authors:                                                             # */
/* #   - BESNARD Jean-Baptiste jean-baptiste.besnard@cea.fr               # */
/* #                                                                      # */
/* ######################################################################## */

#ifndef BINARY_TREE_H
#define BINARY_TREE_H

#ifdef __cplusplus
extern "C" {
#endif

struct Binary_Tree
{
        int rank;           
        int size;           
        int left_child;     
        int right_child;    
        int parent;         
};


void Binary_Tree_init(struct Binary_Tree *bt, int rank, int size);

void Binary_Tree_release(struct Binary_Tree *bt);

static inline int Binary_Tree_parent(struct Binary_Tree *bt)
{
        return bt->parent;
}

static inline int Binary_Tree_left_child(struct Binary_Tree *bt)
{
        return bt->left_child;
}

static inline int Binary_Tree_right_child(struct Binary_Tree *bt)
{
        return bt->right_child;
}

static inline int Binary_Tree_child_count(struct Binary_Tree *bt)
{
        int ret = 0;
        
        if( 0 <=  Binary_Tree_left_child(bt) )
                ret ++;
        
        if( 0 <=  Binary_Tree_right_child(bt) )
                ret ++;
        
        return ret;
}


#ifdef __cplusplus
}
#endif


#endif /* BINARY_TREE_H */