Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Tree
//Title of this code //gcc 4.9.2 #include<stdio.h> #include <stdio.h> #define SENTINELLE -1000 typedef struct Node Node; struct Node { int content; Node*Left; Node*Right; }; typedef struct Binary_Search_Tree Tree; struct Binary_Search_Tree{ Node* Root }; void initialize_tree(Tree**tree){ *tree=(Tree*)malloc(sizeof(Tree)); if(*tree==NULL){ printf("Error memory allocation failled retry later !!!"); exit(1); } (*tree)->Root=NULL; } Node* initialize_node(int content){ Node* node=(Node*)malloc(sizeof(Node)); if(node==NULL){ printf("Error memory allocation failled retry later !!!"); exit(1); } node->content=content; node->Left=NULL; node->Right=NULL; return node; } int is_the_tree_empty(Tree*tree){ if(tree==NULL)return 1; else return 0; } int main(void) { printf("Hello, world!\n"); return 0; }
run
|
edit
|
history
|
help
0
hwkpractice
merge two dice clay to head sport green globe attacked me seven of prime minister fired
Lab 7 blackjack v0.6
a
bitmask
Linked List demo in C
A_141117_Primo01
Logical Series
Strncpy memcpy
Collatz(3k+1)