node Struct Reference

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
	List pointers.
struct node *	prev
uint64_t	value
	Data stored on each 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.

to verify assumptions made by the program and print a diagnostic message if this assumption is false.

to provide a set of integer types with universally consistent definitions that are operating system-independent for IO operations for including functions involving memory allocation such as malloc

Circular Doubly linked list struct

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

Field Documentation

next

struct node * node::next

List pointers.

pointer to the node

---

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

• data_structures/binary_trees/binary_search_tree.c
• data_structures/binary_trees/create_node.c
• data_structures/binary_trees/red_black_tree.c
• data_structures/graphs/bfs.c
• data_structures/graphs/dfs.c
• data_structures/graphs/queue.c
• data_structures/graphs/strongly_connected_components.c
• data_structures/graphs/topological_sort.c
• data_structures/linked_list/ascending_priority_queue.c
• data_structures/linked_list/circular_doubly_linked_list.c
• data_structures/linked_list/circular_linked_list.c
• data_structures/linked_list/merge_linked_lists.c
• data_structures/linked_list/queue_linked_list.c
• data_structures/linked_list/singly_link_list_deletion.c
• data_structures/linked_list/stack_using_linked_lists.c
• data_structures/queue/include.h
• data_structures/stack.c
• data_structures/stack/parenthesis.c
• process_scheduling_algorithms/non_preemptive_priority_scheduling.c