problemscpp
A collection of my answers to algorithm problems in c++.
载入中...
搜索中...
未找到
leetcode::convert_bst_to_greater_tree 命名空间参考

struct  FriendTreeNode
 
class  Solution
 

函数

 TEST (convert_bst_to_greater_tree, case1)
 

函数说明

◆ TEST()

leetcode::convert_bst_to_greater_tree::TEST ( convert_bst_to_greater_tree ,
case1  )

在文件 leetcode_test.cpp200 行定义.

200 {
201 auto *input = new TreeNode(4, new TreeNode(1, new TreeNode(0), new TreeNode(2, nullptr, new TreeNode(3))),
202 new TreeNode(6, new TreeNode(5), new TreeNode(7, nullptr, new TreeNode(8))));
203 const auto *ans = new TreeNode(30, new TreeNode(36, new TreeNode(36), new TreeNode(35, nullptr, new TreeNode(33))),
204 new TreeNode(21, new TreeNode(26), new TreeNode(15, nullptr, new TreeNode(8))));
205 const auto *output = Solution::convertBST(input);
206 ASSERT_TRUE(*ans == *output);
207 }
static TreeNode * convertBST(TreeNode *root)

引用了 leetcode::convert_bst_to_greater_tree::Solution::convertBST().