leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static void	copy (TreeNode *tn, TreeNodeP *tnp, int low, int high, TreeNodeP **p, TreeNodeP **q)
static TreeNode *	lowestCommonAncestor (TreeNode *root, TreeNode *p, TreeNode *q)

详细描述

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

成员函数说明

copy()

void leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::copy ( TreeNode *  tn, TreeNodeP *  tnp, int  low, int  high, TreeNodeP **  p, TreeNodeP **  q  )

static

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

                                                                                                         {
            tnp->mirror = tn;
            if(tn->val == low) {
                *p = tnp;
            } else if(tn->val == high) {
                *q = tnp;
            }
            if(tn->left != nullptr) {
                tnp->left         = new TreeNodeP(tn->left->val);
                tnp->left->parent = tnp;
                copy(tn->left, tnp->left, low, high, p, q);
            }
            if(tn->right != nullptr) {
                tnp->right         = new TreeNodeP(tn->right->val);
                tnp->right->parent = tnp;
                copy(tn->right, tnp->right, low, high, p, q);
            }
        }

引用了 copy(), leetcode::TreeNode::left, leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::left, leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::mirror, leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::parent, leetcode::TreeNode::right, leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::right , 以及 leetcode::TreeNode::val.

被这些函数引用 copy() , 以及 lowestCommonAncestor().

lowestCommonAncestor()

TreeNode * leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::lowestCommonAncestor ( TreeNode *  root, TreeNode *  p, TreeNode *  q  )

static

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

                                                                                         {
            auto *const tnp = new TreeNodeP(root->val);
            TreeNodeP *pp;
            TreeNodeP *qq;
            copy(root, tnp, p->val, q->val, &pp, &qq);
            TreeNodeP *current = pp;
            while(current != nullptr) {
                current->ed = true;
                current     = current->parent;
            }
            current = qq;
            while(current != nullptr) {
                if(current->ed) {
                    return current->mirror;
                }
                current = current->parent;
            }
            return root;
        }

引用了 copy(), leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::ed, leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::mirror, leetcode::lowest_common_ancestor_of_a_binary_search_tree::TreeNodeP::parent, acwing::acwing836_408::root , 以及 leetcode::TreeNode::val.

被这些函数引用 leetcode::lowest_common_ancestor_of_a_binary_search_tree::TEST().

---

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

• leetcode.h
• leetcode.cpp