leetcode::delete_node_in_a_bst::Solution类 参考

#include <leetcode.h>

Public 成员函数
TreeNode *	deleteNode (TreeNode *root, int key)
TreeNode *	findMaximum (TreeNode *node)
TreeNode *	findMinimum (TreeNode *node)
void	remove (TreeNode *node)

Private 属性
TreeNode *	prev

详细描述

在文件 leetcode.h 第 2720 行定义.

成员函数说明

deleteNode()

TreeNode * leetcode::delete_node_in_a_bst::Solution::deleteNode	(	TreeNode *	root,
		int	key
	)

在文件 leetcode.cpp 第 7445 行定义.

                                                              {
            if(root == nullptr) {
                return root;
            }
            TreeNode *current = root;
            while(current != nullptr && current->val != key) {
                if(current->val == key) {
                    break;
                }
                prev = current;
                if(current->val < key) {
                    current = current->right;
                } else {
                    current = current->left;
                }
            }
            if(current == nullptr) {
                return root;
            }
            if(root->left == nullptr && root->right == nullptr) {
                return nullptr;
            }
            remove(current);
            return root;
        }

引用了 leetcode::TreeNode::left, prev, remove(), leetcode::TreeNode::right, acwing::acwing836_408::root , 以及 leetcode::TreeNode::val.

findMaximum()

TreeNode * leetcode::delete_node_in_a_bst::Solution::findMaximum

(

TreeNode *

node

)

在文件 leetcode.cpp 第 7400 行定义.

                                                      {
            TreeNode *current = node;
            while(current->right != nullptr) {
                prev    = current;
                current = current->right;
            }
            return current;
        }

引用了 prev , 以及 leetcode::TreeNode::right.

被这些函数引用 remove().

findMinimum()

TreeNode * leetcode::delete_node_in_a_bst::Solution::findMinimum

(

TreeNode *

node

)

在文件 leetcode.cpp 第 7409 行定义.

                                                      {
            TreeNode *current = node;
            while(current->left != nullptr) {
                prev    = current;
                current = current->left;
            }
            return current;
        }

引用了 leetcode::TreeNode::left , 以及 prev.

被这些函数引用 remove().

remove()

void leetcode::delete_node_in_a_bst::Solution::remove

(

TreeNode *

node

)

在文件 leetcode.cpp 第 7418 行定义.

                                            {
            if(node->right != nullptr) {
                prev             = node;
                auto *const rmin = findMinimum(node->right);
                node->val        = rmin->val;
                remove(rmin);
                return;
            }
            if(node->left != nullptr) {
                prev             = node;
                auto *const lmax = findMaximum(node->left);
                node->val        = lmax->val;
                remove(lmax);
                return;
            }
            if(prev != nullptr) {
                if(prev->left != nullptr && prev->left->val == node->val) {
                    prev->left = nullptr;
                } else if(prev->right != nullptr && prev->right->val == node->val) {
                    prev->right = nullptr;
                }
            } else {
                exit(-1);
            }
            //delete node;
        }

引用了 findMaximum(), findMinimum(), leetcode::TreeNode::left, pat::a::a7_2::lmax, prev, remove(), leetcode::TreeNode::right, pat::a::a7_2::rmin , 以及 leetcode::TreeNode::val.

被这些函数引用 deleteNode() , 以及 remove().

类成员变量说明

prev

TreeNode* leetcode::delete_node_in_a_bst::Solution::prev

private

在文件 leetcode.h 第 2721 行定义.

被这些函数引用 deleteNode(), findMaximum(), findMinimum() , 以及 remove().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp