Uponic

#include #include

TypedEf struct node {int data; struct node * left; struct node * right;} node; void print (node ​​* p) {if (p! = null) {print (p-> left); printf ("% D / N ", P-> Data); Print (p-> right);}} void main () {int N; scanf ("% d ", & n); node * head = (node ​​*) Malloc (sizeof (Node) )); Head-> Data = N; head-> left = null; head-> right = null; scanf ("% d", & n); while (n! = - 1) {node * p = (node ​​* ) Malloc (SIDE);

P-> Data = N; P-> LEFT = NULL; P-> Right = NULL; Node * q = Head; Node * f = q; While (q! = null) {if (n data) {F = q; q = q-> left; continue;}} (n> Q-> DATA) {f = q; q = Q-> Right; Continue;}} if (n data) f -> left = p; if (n> f-> data) f-> right = p; scanf ("% d", & n);} print (head);}