树状结构表的增删改查用代码怎么写
时间: 2023-03-30 13:02:26 浏览: 85
对于树状结构表的增删改查,可以使用递归算法来实现。以下是示例代码:
1. 增加节点:
void addNode(TreeNode* root, TreeNode* newNode) {
if (root == NULL) {
root = newNode;
return;
}
if (newNode->val < root->val) {
addNode(root->left, newNode);
} else {
addNode(root->right, newNode);
}
}
2. 删除节点:
TreeNode* deleteNode(TreeNode* root, int val) {
if (root == NULL) {
return NULL;
}
if (val < root->val) {
root->left = deleteNode(root->left, val);
} else if (val > root->val) {
root->right = deleteNode(root->right, val);
} else {
if (root->left == NULL) {
TreeNode* temp = root->right;
delete root;
return temp;
} else if (root->right == NULL) {
TreeNode* temp = root->left;
delete root;
return temp;
} else {
TreeNode* temp = findMin(root->right);
root->val = temp->val;
root->right = deleteNode(root->right, temp->val);
}
}
return root;
}
TreeNode* findMin(TreeNode* root) {
while (root->left != NULL) {
root = root->left;
}
return root;
}
3. 修改节点:
void modifyNode(TreeNode* root, int oldVal, int newVal) {
TreeNode* node = searchNode(root, oldVal);
if (node != NULL) {
node->val = newVal;
}
}
4. 查找节点:
TreeNode* searchNode(TreeNode* root, int val) {
if (root == NULL || root->val == val) {
return root;
}
if (val < root->val) {
return searchNode(root->left, val);
} else {
return searchNode(root->right, val);
}
}