数据结构研究之七 二叉搜索树

1.二叉搜索树的插入：
a.题目：向二叉树中插入合适的节点
b.要点：要使二叉搜索树保持良好的平衡，才能降低插入元素操作的复杂度为O(logn)。

c.代码：

//
// Created by 叶子 on 2018/2/4.
// 有序二叉树的插入
//

#include "cstdio"
#include "cstdlib"
#include "string"
#include "iostream"
using namespace std;

struct Node{
    int key;
    Node *right,*left,*parent;
};

Node *root,*NIL;

void insert(int k){
    Node *y = NIL;
    Node *x = root;
    Node *z;

    z = (Node *)malloc(sizeof(Node));
    z->key = k;
    z->left = NIL;
    z->right = NIL;

    while ( x != NIL){
        y = x;
        if ( z->key < x->key){
            x = x->left;
        }else{
            x = x->right;
        }
    }

    z->parent = y;
    if ( y == NIL){
        root = z;
    }else{
        if ( z->key < y ->key){
            y->left = z;
        }else{
            y->right = z;
        }
    }
}

void inorder(Node *u){
    if ( u == NIL) return;
    inorder(u->left);
    printf(" %d",u->key);
    inorder(u->right);
}

void preorder(Node *u){
    if ( u == NIL) return;
    printf(" %d",u->key);
    preorder(u->left);
    preorder(u->right);
}

int main(){
    int n,i,x;
    string com;

    scanf("%d",&n);

    for ( i = 0 ; i < n ; i ++){
        cin >> com;
        if ( com == "insert"){
            scanf("%d",&x);
            insert(x);
        }else if ( com == "print"){
            inorder(root);
            printf("\n");
            preorder(root);
            printf("\n");
        }
    }

    return 0;
}

2.二叉搜索树的搜索：
a.题目：在二叉搜索树中找出含有指点键值的结点
b.分析：以根为起点向叶子搜索，如果给定键值小于当前键值则搜索左子结点，反之搜索右子结点。如果结点不存在则返回空
c.代码：

//
// Created by 叶子 on 2018/2/4.
// 有序二叉树的搜索
//

#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#include "iostream"
using namespace std;

struct Node{
    int key;
    Node *right,*left,*parent;
};

Node *root,*NIL;

Node * find(Node *u,int k){
    while ( u != NIL && k != u->key){
        if ( k < u->key ) u = u->left;
        else u = u -> right;
    }
    return u;
}

void insert(int k){
    Node *y = NIL;
    Node *x = root;
    Node *z;

    z = (Node *)malloc(sizeof(Node));
    z->key = k;
    z->left = NIL;
    z->right = NIL;

    while ( x != NIL){
        y = x;
        if ( z->key < x->key){
            x = x->left;
        }else{
            x = x->right;
        }
    }

    z->parent = y;
    if ( y == NIL){
        root = z;
    }else{
        if ( z->key < y ->key){
            y->left = z;
        }else{
            y->right = z;
        }
    }
}

void inorder(Node *u){
    if ( u == NIL) return;
    inorder(u->left);
    printf(" %d",u->key);
    inorder(u->right);
}

void preorder(Node *u){
    if ( u == NIL) return;
    printf(" %d",u->key);
    preorder(u->left);
    preorder(u->right);
}

int main(){
    int n,i,x;
    string com;

    scanf("%d",&n);

    for ( i = 0 ; i < n ; i ++){
        cin >> com;
        if ( com == "find") {
            scanf("%d",&x);
            Node *t = find(root,x);
            if ( t != NIL) printf("yes\n");
            else printf("no\n");
        }else if ( com == "insert"){
            scanf("%d",&x);
            insert(x);
        }else if ( com == "print"){
            inorder(root);
            printf("\n");
            preorder(root);
            printf("\n");
        }
    }

    return 0;
}

3.二叉搜索树的删除：
a.题目：从二叉搜索树中删除指定节点
b.要点：在删除指定二叉搜索树中的元素时，需要花费O(h)找出含有指定键值的结点，然后需要O(h)找出后一个结点。为了提高程序效率，需要尽量压缩树的高度
c.代码：

//
// Created by 叶子 on 2018/2/4.
// 二叉树中的删除节点
//

#include "stdio.h"
#include "stdlib.h"
#include "string"
#include "iostream"
using namespace std;

struct Node{
    int key;
    Node *right,*left,*parent;
};

Node *root,*NIL;

Node * treeMinimum(Node *x){
    while ( x->left != NIL ) x = x->left;
    return x;
}

Node * find(Node *u,int k){
    while ( u != NIL && k != u->key){
        if ( k < u->key ) u = u->left;
        else u = u ->right;
    }
    return u;
}

Node * treeSuccessor(Node *x){
    if ( x->right != NIL) return treeMinimum(x->right);
    Node *y = x->parent;
    while ( y != NIL && x == y->right){
        x = y;
        y = y->parent;
    }
    return y;
}

void treeDelete(Node *z){
    Node *y ;
    Node *x;

    if ( z->left == NIL || z->right == NIL) y = z;
    else y = treeSuccessor(z);

    if ( y->left != NIL){
        x = y->left;
    }else{
        x = y->right;
    }

    if ( x != NIL){
        x ->parent = y ->parent;
    }

    if ( y->parent == NIL){
        root = x;
    } else{
        if ( y == y->parent->left){
            y ->parent->left = x;
        }else{
            y->parent->right = x;
        }
    }

    if ( y!= z){
        z->key = y->key;
    }

    free(y);
}

void insert(int k){
    Node *y = NIL;
    Node *x = root;
    Node *z;

    z = (Node *)malloc(sizeof(Node));
    z->key = k;
    z->left = NIL;
    z->right = NIL;

    while ( x != NIL){
        y = x;
        if ( z->key < x->key){
            x = x->left;
        }else{
            x = x->right;
        }
    }

    z->parent = y;
    if ( y == NIL){
        root = z;
    }else{
        if ( z->key < y ->key){
            y->left = z;
        }else{
            y->right = z;
        }
    }
}

void inorder(Node *u){
    if ( u == NIL) return;
    inorder(u->left);
    printf(" %d",u->key);
    inorder(u->right);
}

void preorder(Node *u){
    if ( u == NIL) return;
    printf(" %d",u->key);
    preorder(u->left);
    preorder(u->right);
}

int main(){
    int n,i,x;
    string com;

    scanf("%d",&n);

    for ( i = 0 ; i < n ; i ++){
        cin >> com;
        if ( com[0] == 'f'){
            scanf("%d",&x);
            Node *t = find(root,x);
            if ( t != NIL) printf("yes\n");
            else printf("no\n");
        }else if ( com[0] == 'i'){
            scanf("%d",&x);
            insert(x);
        }else if ( com[0] == 'p'){
            inorder(root);
            printf("\n");
            preorder(root);
            printf("\n");
        }else if ( com[0] == 'd'){
            scanf("%d",&x);
            treeDelete(find(root,x));
        }
    }

    return 0;
}

4.通过标准库管理集合：
a.C++中管理元素集合的STL集合分为两种，一种是序列式容器以表示有顺序的集合，另一种是关联式集合以表示经过排序的集合
b.set:不重复的进行排序的集合
c.stl中的set标准库的示例：

//
// Created by 叶子 on 2018/2/4.
// 使用set这个有序集合
//

#include "iostream"
#include "set"
using namespace std;

void print(set<int> S){
    cout << S.size() << ":";
    for ( set<int>::iterator it = S.begin() ; it != S.end(); it ++){
        cout << " " << (*it);
    }
    cout << endl;
}

int main(){
    set<int> S;

    S.insert(8);
    S.insert(1);
    S.insert(7);
    S.insert(4);
    S.insert(8);
    S.insert(4);

    print(S);

    S.erase(7);

    print(S);

    S.insert(2);
    print(S);

    if ( S.find(10) == S.end() ) cout<< "not found."<<endl;
    return 0;
}

d.map是键值对的集合
e.map的示例代码：

//
// Created by 叶子 on 2018/2/4.
// STL中的map库
//

#include "iostream"
#include "map"
#include "string"
using namespace std;

void print(map<string ,int> T){
    map<string,int>::iterator it;
    cout << T.size() << endl;
    for ( it = T.begin(); it != T.end(); it ++){
        pair<string,int> item = *it;
        cout << item.first << " -->" << item.second << endl;
    }
}

int main(){
    map<string,int> T;

    T["red"] = 32;
    T["blue"] = 688;
    T["yellow"] = 122;
    T["blue"] = 312;

    print(T)

    T.insert(make_pair("zebra",101010));
    T.insert(make_pair("white",0));
    T.erase("yellow");

    print(T);

    pair<string,int> target = *T.find("red");
    cout << target.first << " -->" << target.second << endl;

    return 0;
}