binomial.h File Reference

#include <memory.h>
#include "sym_proto.h"

Include dependency graph for binomial.h:

Go to the source code of this file.

Classes
struct	TREE_NODE

Typedefs
typedef struct TREE_NODE	tree_node

Functions
tree_node *find_max	PROTO ((tree_node *head))
tree_node *make_heap	PROTO ((int custnum, int savings, int node1, int node2))
tree_node *merge_heaps	PROTO ((tree_node *head1, tree_node *head2))
tree_node *heap_insert	PROTO ((tree_node *head, int cust_num, int savings, int node1, int node2))
tree_node *extract_max	PROTO ((tree_node *head, tree_node *max_ptr))
void link_trees	PROTO ((tree_node *tree1, tree_node *tree2))
void exchange_data	PROTO ((tree_node *tree_node1, tree_node *tree_node2))
void update	PROTO ((tree_node *cur_node, int savings, int node1, int node2))

Typedef Documentation

typedef struct TREE_NODE tree_node

Function Documentation

tree_node *reverse_list PROTO

(

(tree_node *head)

)

tree_node* make_heap PROTO

(

(int custnum, int savings, int node1, int node2)

)

tree_node *merge_roots PROTO

(

(tree_node *head1, tree_node *head2)

)

tree_node* heap_insert PROTO

(

(tree_node *head, int cust_num, int savings, int node1, int node2)

)

tree_node* extract_max PROTO

(

(tree_node *head, tree_node *max_ptr)

)

void link_trees PROTO

(

(tree_node *tree1, tree_node *tree2)

)

void exchange_data PROTO

(

(tree_node *tree_node1, tree_node *tree_node2)

)

void update PROTO

(

(tree_node *cur_node, int savings, int node1, int node2)

)