C++ (Cpp) Solution::IsBalanced_Solution Examples

Example #1

File: solution_01.cpp Project: sharpdeep/coding-challenge

int main()
{
    	TreeNode* tree = (TreeNode*)malloc(sizeof(TreeNode));
    	TreeNode* p = tree;
	
    	tree->val = 0;
    	for(int i = 1; i < 10; i+=2){
        	TreeNode* left = (TreeNode*)malloc(sizeof(TreeNode));
        	TreeNode* right = (TreeNode*)malloc(sizeof(TreeNode));
        	left->val = i;
        	right->val = i+1;
        		p->left = left;
        	p->right = right;
        	if((i-1)%4 == 0){
            		p = left;   
        	}else{
            		p = right;
        	}
    	}

	Solution s = Solution();
	bool r = s.IsBalanced_Solution(tree);
	string result = r==1?"true":"false";

	cout<<result<<endl;
}

Example #2

File: Coding_026.cpp Project: zymix/Offer_Code

int main()
{
	Solution a;
	TreeNode* pRoot = new TreeNode(1);
	pRoot->left = new TreeNode(2);
	pRoot->right = new TreeNode(3);
	pRoot->left->left = new TreeNode(4);
	pRoot->left->right = new TreeNode(5);
	//pRoot->left->right->left = new TreeNode(6);

	cout << a.IsBalanced_Solution(pRoot) << ' ';
	DestoryTree(pRoot);
	system("pause");
	return 0;
}