aoj

# ALDS1_8_C Tree - Binary Search Tree 3

ALDS1_8_C Tree - Binary Search Tree 3
Feb. 2, 2020, 1:52 p.m.

## 解答

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 struct Node { int key; Node *parent, *left, *right; }; Node *root, *NIL; void insert(int key) { Node *y = NIL; Node *x = root; Node *z = (Node *)malloc(sizeof(Node)); z->key = key; z->left = NIL; z->right = NIL; while (x != NIL) { y = x; if (key < x->key) { x = x->left; } else { x = x->right; } }; z->parent = y; if (y == NIL) { root = z; return; } if (key <= y->key) { y->left = z; } else { y->right = z; } }; Node *findNode(Node *node, int key) { Node* cur = node; while (cur != NIL && cur->key != key) { if (key < cur->key) { cur = cur->left; } else { cur = cur->right; } } return cur; } bool find(Node *node, int key) { return findNode(node, key) != NIL; } Node *tMin(Node *node) { while (node->left != NIL) { node = node->left; } return node; } Node *tSuccessor(Node *node) { if (node->right != NIL) { return tMin(node->right); } Node *y = node->parent; while (y != NIL && node == y->right) { node = y; y = y->parent; } return y; } void tDelete(Node *z) { Node *y, *x; if (z->left == NIL || z->right == NIL) y = z; else y = tSuccessor(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 preorder(Node *node) { if (node == NIL) return; cout << " " << node->key; preorder(node->left); preorder(node->right); } void inorder(Node *node) { if (node == NIL) return; inorder(node->left); cout << " " << node->key; inorder(node->right); } int main() { int n, x; string op; cin >> n; for (int i=0; i> op; if (op[0] == 'i') { cin >> x; insert(x); continue; } else if (op[0] == 'd') { cin >> x; tDelete(findNode(root, x)); continue; } else if (op[0] == 'f') { cin >> x; if (find(root, x)) { cout << "yes" << endl; } else { cout << "no" << endl; } continue; } else if (op[0] == 'p') { inorder(root); cout << endl; preorder(root); cout << endl; continue; } } return 0; }