treeVal.h

#ifndef TREEVAL_H
#define TREEVAL_H
 
#include <assert.h>
#include <stdio.h> //NULL
#include <stdlib.h> //malloc
#include "utils.h"
 
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define MAX_N 1100000
 
typedef struct Node{
    int key;
    struct Node* leaf[2];
    struct Node* parent;
    int visited;
} Node;
 
typedef struct {
    Node* nodes;
    int n;
} problem;
 
 
problem init_problem(int N_nodes);
void kill_problem(problem);
 
void CreateNodes(problem, int ID, int key, int IDleft, int IDright);
 
int findOrigin(Node*);
 
int valid_tree_walk(Node* node, int min, int max);
 
void interface(void);
 
#endif