#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}

int NIL=2000000001;
int root=NIL;

struct Node{
    int parent=NIL,sibling=NIL,left=NIL,right=NIL;
};
umap<int,Node> tree;

/*先行順巡回*/
void preParse(int n){
    if(n==NIL){
        return;
    }
    printf(" %d",n);
    preParse(tree[n].left);
    preParse(tree[n].right);
}

/*中間順巡回*/
void inParse(int n){
    if(n==NIL){
        return;
    }
    inParse(tree[n].left);
    printf(" %d",n);
    inParse(tree[n].right);
}

void insert(int x,int z){
    if(root==NIL){
        tree[x];
        root=x;
    }else{
        if(x<z){
            if(tree[z].left==NIL){
                tree[z].left=x;
                tree[x].parent=z;
            }else{
                insert(x,tree[z].left);
            }
        }else{
            if(tree[z].right==NIL){
                tree[z].right=x;
                tree[x].parent=z;
            }else{
                insert(x,tree[z].right);
            }
        }
    }
}

void deleteNode(int x){
    if(tree.count(x)){
        if(x<tree[x].parent){
            tree[tree[x].parent].left=NIL;
            tree.erase(x);
        }
        if(x>tree[x].parent){
            tree[tree[x].parent].right=NIL;
            tree.erase(x);
        }
    }
}

int main(){
    int m;
    in(m);
    string command;
    int x;
    while(m--){
        in(command);
        if(command=="insert"){
            in(x);
            insert(x,root);
        }
        else if(command=="print"){
            if(root!=NIL){
                inParse(root);putchar('\n');
                preParse(root);putchar('\n');
            }
        }
        else if(command=="find"){
            in(x);
            if(tree.count(x))printf("yes\n");
            else printf("no\n");
        }
        else if(command=="delete"){
            in(x);
            deleteNode(x);
        }
    }
}


Measured memory_bytes: 25716