Function get_height

Trees/Binary_tree_Array.c:85–93

}

int get_height(int index)
{
    // if the node is a leaf the the height will be 0
    // the height will be 0 also for the invalid cases
    if(tree[index]=='\0' || index<=0 || is_leaf(index))
        return 0;
    // height of node i is 1+ maximum among the height of left subtree and the height of right subtree
    return(get_max(get_height(get_left_child(index)), get_height(get_right_child(index)))+1);
}