Node, the basic data structure in the tree. More...

#include <include.h>

Collaboration diagram for node:

Data Fields
struct node *	left
	left child

struct node *	right
	right child

int	data
	data of the node

struct node *	leftNode

struct node *	rightNode

int	val

struct node *	par

int	color

int	vertex

struct node *	next
	pointer to the node

int	info

struct node *	link

struct node *	pre

char	data

int	ID
	ID of the process node.

int	AT
	Arrival Time of the process node.

int	BT
	Burst Time of the process node.

int	priority
	Priority of the process node.

int	CT
	Completion Time of the process node.

int	WT
	Waiting Time of the process node.

int	TAT
	Turn Around Time of the process node.

Detailed Description

Node, the basic data structure in the tree.

for assert

Kyler Smith, 2017 Stack data structure implementation.

INCLUDES.

Defining the structure of the node which contains 'data' (type : integer), two pointers 'next' and 'pre' (type : struct node).

creating a stucture with 'data'(type:int), two pointers 'next','pre' (type: struct node) .

for boolean data type for IO operations (printf) for memory allocation eg: malloc, realloc, free, exit

Structure to represent a process

The documentation for this struct was generated from the following files:

Data Fields