太惡心了，三種情況理解就好

//! 刪除結(jié)點(diǎn) void BinarySearchTreesZH::remove(Node *node) {if (node->left != nullptr && node->right != nullptr)//! 把刪除度為2 的結(jié)點(diǎn)的問(wèn)題轉(zhuǎn)化為刪除{node->element = predecessor(node)->element;remove(predecessor(node));}else if (node->left == nullptr && node->right == nullptr) //! 刪除度為0的結(jié)點(diǎn){if (node->parent == nullptr) //! 若結(jié)點(diǎn)是根結(jié)點(diǎn)直接置空{node = nullptr;}if (node == node->parent->left) //!結(jié)點(diǎn)時(shí)葉結(jié)點(diǎn)時(shí)的置空{node->parent->left = nullptr;}if (node == node->parent->right){node->parent->right = nullptr;}//!我覺(jué)得這里直接全都node = nullptr應(yīng)該是一樣的}else{//! 刪除度為1的結(jié)點(diǎn)if (node->parent == nullptr)//!若結(jié)點(diǎn)是根結(jié)點(diǎn)，用其子結(jié)點(diǎn)替代成為根結(jié)點(diǎn){if (node->left != nullptr){root = node->left;}else if (node->right != nullptr){root = node->right;}}else if (node == node->parent->left){//! 結(jié)點(diǎn)是父結(jié)點(diǎn)的左子結(jié)點(diǎn)或右子結(jié)點(diǎn)時(shí)，改動(dòng)雙向指針，和雙向鏈表刪除結(jié)點(diǎn)操作一樣if (node->left != nullptr){node ->parent->left = node ->left;node ->left->parent = node ->parent;}else if (node->right != nullptr){node ->parent->left = node->left;node ->left ->parent = node ->parent;}}else if (node == node ->parent ->right){if (node->left != nullptr){node ->parent->right = node ->left;node ->left->parent = node ->parent;}else if (node->right != nullptr){node ->parent->right = node->left;node ->left ->parent = node ->parent;}}} }

總結(jié)

以上是生活随笔為你收集整理的2021-10-11 二叉树 删除结点 （用到parent指针）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。