C++ (Cpp) Solution::generateTrees Examples

Example #1

File: 95_UniqueBinarySearchTreesII.cpp Project: GHScan/DailyProjects

int main() {
    Solution so;

    printResult(so.generateTrees(0));
    printResult(so.generateTrees(1));
    printResult(so.generateTrees(2));
    printResult(so.generateTrees(3));
    printResult(so.generateTrees(4));
}

Example #2

File: UniqueBinarySearchTreeII.cpp Project: xjsXjtu/leetcode

int main()
{
    Solution s;
    vector<TreeNode*> out;
    out = s.generateTrees(0);
    out = s.generateTrees(1);
    out = s.generateTrees(3);
    out = s.generateTrees(4);

    system("pause");
    return 0;
}

Example #3

File: unique_bsts2.cpp Project: jizhilong/leetcodeoj-solutions

int
main()
{
  Solution solution;
  vector<TreeNode *> trees = solution.generateTrees(1);
  assert(trees.size() == 1);
  trees = solution.generateTrees(2);
  assert(trees.size() == 2);
  trees = solution.generateTrees(3);
  assert(trees.size() == 5);
  trees = solution.generateTrees(4);
  assert(trees.size() == 14);
}

Example #4

File: generateBSTtrees.cpp Project: zkmake520/Algorithms

int main(){
    
    Solution sol;
    // cout<<1<<endl;
    vector<TreeNode *>ret = sol.generateTrees(3);
    cout<<1<<endl;
}

Example #5

File: 095uniqueBinarySearchTrees.II.cpp Project: apprentice7/Leetcode

/* unit testing */
int main() {
	Solution test;
	vector<TreeNode*> testing = test.generateTrees(3);
	for(int i=0; i<testing.size(); i++) {
		cout << testing[i]->val << endl;
	}
	return 0;
}

Example #6

File: UniqueBinarySearchTreesII.cpp Project: Jessicahust/Leetcode

int main()
{
    Solution s;
    vector<TreeNode*> vec=s.generateTrees(3);
    for(auto a:vec)
        cout<<a->val<<" ";
    cout<<endl;
}

Example #7

File: uniqueBinarySearchTreesII.cpp Project: seuzl/myleetcode

int main() {
    Solution sol;
    vT ret = sol.generateTrees(0);
    
    for(auto &node : ret) {
        printTree(node);
    }
    return 0;
}

Example #8

File: main.cpp Project: EFanZh/EFanZh

int main()
{
    int testCases[] = { 1 };
    Solution s;

    for (auto testCase : testCases)
    {
        s.generateTrees(testCase);
    }
}

Example #9

File: UniqueBinarySearchTreesII.cpp Project: hiberabyss/octopress-blog

int main(int argc, char *argv[]) {
    Solution sol;
    {
        auto res = sol.generateTrees(3);
        for (auto t : res) {
            printPretty(t, 1, 1, cout);
        }
    }
    return 0;
}

Example #10

File: main.cpp Project: chenyahui/Leetcode_Solutions

int main()
{
    Solution solve;
    auto result=solve.generateTrees(3);
    for(auto item:result)
    {
      show(item);
      cout<<"\n";
    }
    return 0;
}

Example #11

File: medium_unique_binary_search_trees_ii.cpp Project: wonghoifung/tips

int main()
{
	Solution s;
	{
		int n = 3;
		vector<TreeNode*> alltrees = s.generateTrees(n);
		cout << alltrees.size() << endl;
	}

	std::cin.get();
	return 0;
}

Example #12

File: Unique_Binary_Search_Trees_II.cpp Project: francliu/leetcode

int main()
{
	Solution s;
	vector<TreeNode*> res = s.generateTrees(4);
	cout << endl;
	for (size_t i = 0; i<res.size(); i++)
	{
		s.postTree(res[i]);
		cout << endl;
	}
	return 0;
}

Example #13

File: Unique Binary Search Trees II.cpp Project: lujcmss/leetcode

int main() {
    int n = 3;
    
    Solution so;
    vector<TreeNode *> ans = so.generateTrees(n);
    
    for (int i = 0; i < ans.size(); i++)
        cout << ans[i]->val << " ";
    
    cout << endl;
    
    return 0;
}

Example #14

int main()
{
    Solution s;
    auto trees = s.generateTrees(3);

    for(auto t : trees)
    {
        TreeNode::print(t);
    }

    std::cout<<std::endl;
    return 0;
}

Example #15

File: UniqueBinarySearchTreesII.cpp Project: psc0606/algorithm

int main()
{
	Solution s;
//	int n = 0; //1, 其值为空
//	int n = 1; //1
//	int n = 2; //2
	int n = 3; //5 = 2 + 1 + 2
//	int n = 4; //14 = 5 + 2 + 2 + 5
//	int n = 5; //
	vector<TreeNode*> res = s.generateTrees(n);
	cout << res.size() << endl;
	system("pause");
}

Example #16

File: N095UniBiSrhTreeII.cpp Project: vinceyuan/leetcode_solutions

	void test() {
		Solution so;
		cout << "N095UniBiSrhTreeII:\t";
		vector<TreeNode*> result = so.generateTrees(3);
		cout << "[ ";
		for (size_t i = 0, size = result.size(); i < size; i++) {
			TreeNode *root = result[i];
			cout << treeToString(root) << " ";
			deleteTree(root);
		}
		cout << "] ";
		cout << endl;
	}

Example #17

File: UniqueBinarySearchTrees.cpp Project: wencanluo/LeetCode

void main(){
	Solution s;
	
	TreeNode a(1);
	TreeNode b(2);
	TreeNode c(3);
	a.right = &b;
	a.right = &c;
	//b.right = &c;

	cout << s.generateTrees(3).size();
	system("pause");
}

Example #18

File: Unique Binary Search Trees II.cpp Project: Kyne2007/oj

int main(int argc, char *argv[])
{
    Solution sol;

    auto trees = sol.generateTrees(4);

    for (auto r : trees) {
        print(r);
        cout << endl;
    }

    return 0;
}

Example #19

File: unique_binary_search_trees2.cpp Project: erickingcs/algorithm

int main(int argc, char *argv[])
{
    Solution sol;

    vector<TreeNode *> ret = sol.generateTrees(3);
    for (auto e : ret) {
        print_tree_preorder(e);
        cout << endl << "----------------" << endl;
        print_tree_inorder(e);
        cout << endl << "================" << endl;
    }

    return 0;
}

Example #20

File: unique-binary-search-trees.2.cpp Project: tdkr/leetcode

int main() {
    string line;
    while (getline(cin, line)) {
        int n = stringToInteger(line);
        
        Solution *sol = new Solution();
        vector<TreeNode*> trees = sol->generateTrees(n);
		
		for(auto it = trees.begin(); it != trees.end(); it++) {		
	        string out = treeNodeToString(*it);
	        cout << out << endl;	
		}
    }
    return 0;
}

Example #21

File: UniqueBinarySearchTreesII.cpp Project: littlebanana/lc

int main()
{
    Solution solu;
    vector<TreeNode *> trees = solu.generateTrees(3);

    for (int i = 0; i < trees.size(); i++)
    {
        printTree(trees[i]);
    }
    for (int i = 0; i < trees.size(); i++)
    {
        destroyTree(trees[i]);
    }

    return 0;
}

Example #22

int main()
{
    Solution s;
    vector<TreeNode *> ret;
    int n = 5;
    int i;

    ret = s.generateTrees(n);
    cout << ret.size() << endl;
    /*
    for(i = 0; i < ret.size(); i++) {
        cout << "Print New Tree:" << endl;
        printTree(ret[i]);
    }
    */
}

Example #23

File: 95_Unique_Binary_Search_Trees_II.cpp Project: xliu45/Job-Fun

void main(){
    int n = 0;
    Solution sol;
    vector<TreeNode *> T = sol.generateTrees(n);
}

Example #24

File: Unique_Binary_Search_Trees_II.cpp Project: chiwsy/Algos

int main(){
    Solution s;
    s.generateTrees(3);
    return 0;
}

Example #25

File: unique_binary_search_trees_II_v1.cpp Project: hotbig/letmetry

int main()
{
    Solution s;
    printVectorTree(s.generateTrees(4));
    return 0;
}

Example #26

File: main.cpp Project: halibut735/leetcode

int main(int argc, const char * argv[]) {
    Solution test;
    test.generateTrees(3);
    return 0;
}

Example #27

File: 95 LL.cpp Project: CaptainCan/Leetcode

int main(void)
{
	Solution engine;
	cout << engine.generateTrees(3).size() << '\n';
	return 0;
}

Example #28

File: 095_unique_binary_search_trees_II.cpp Project: huazhou2/leetcode

int main() {
	Solution m;
	vector<TreeNode*> result= m.generateTrees(10);	
	print(result);
	}

Example #29

File: 95. Unique Binary Search Trees II.cpp Project: erichuang1994/leetcode-solution

int main() {
  Solution a;
  a.generateTrees(0);
  return 0;
}