leetcode::lowest_common_ancestor_of_a_binary_search_tree 命名空间参考

1. Lowest Common Ancestor of a Binary Search Tree

更多...

类
class	Solution
struct	TreeNodeP

函数
	TEST (lowest_common_ancestor_of_a_binary_search_tree, case1)

详细描述

1. Lowest Common Ancestor of a Binary Search Tree

函数说明

TEST()

leetcode::lowest_common_ancestor_of_a_binary_search_tree::TEST	(	lowest_common_ancestor_of_a_binary_search_tree	,
		case1
	)

在文件 leetcode_test.cpp 第 2885 行定义.

                                                                    {
            auto *root               = new TreeNode(6);
            root->left               = new TreeNode(2);
            root->right              = new TreeNode(8);
            root->left->left         = new TreeNode(0);
            root->left->right        = new TreeNode(4);
            root->left->right->left  = new TreeNode(3);
            root->left->right->right = new TreeNode(5);
            root->right->left        = new TreeNode(7);
            root->right->right       = new TreeNode(9);
            Solution s;
            ASSERT_EQ(6, s.lowestCommonAncestor(root, root->left, root->right)->val);
        }

引用了 leetcode::lowest_common_ancestor_of_a_binary_search_tree::Solution::lowestCommonAncestor(), acwing::acwing836_408::root , 以及 leetcode::TreeNode::val.