#include <stdio.h>

/*Макросы для сравнения Equal, Lower Than, Greater Than*/
#define CMP_EQ(a, b) ((a) == (b))
#define CMP_LT(a, b) ((a) < (b))
#define CMP_GT(a, b) ((a) > (b))

struct node{
	int data;
	struct node *left;
	struct node *right;
	struct node *parent;
};

/*Процелура в псевдокоде*/
/*
Tree_Search(x, k)
	while x != NIL and k != key[x] do
		if k < key[x]
			then x <- left[x]
			else x <- right[x]
	return x
*/

/*Реализация на си*/
struct node * TreeSearch(struct node *root, int k){
	while(root != NULL && root->data != k){
		if(k < root->data)
			root = root->left;
		else
			root = root->right;
	}
	return root;
}

int main(void) {
	// your code goes here
	return 0;
}