Week2

inorder.cpp

void Inorder(node *root) {
	if (root) {
		Inorder(root->left);
		cout << to_string(root->data) + " ";
		Inorder(root->right);
	}

}

postorder.cpp

void Postorder(node *root) {
    	if (root) {
		Postorder(root->left);
		Postorder(root->right);
		std::cout << to_string(root->data)+" ";
	}
}

preorder.cpp

void Preorder(node *root) {
    	if (root) {
		std::cout << to_string(root->data)+" ";
		Preorder(root->left);
		Preorder(root->right);
	}
}

sumtree.cpp

class Solution {
public:
        int sumNumbers(TreeNode * n)
{
	int sum=0;
	sumNumbers(n, 0, sum);
	return sum;
}

void sumNumbers(TreeNode * n, int currNum, int &sum)
{
		if (!n)
			return;
        currNum= currNum*10+n->val;
		if (!n->left && !n->right)
			sum += currNum;
		if (n->left)
			sumNumbers(n->left, currNum, sum);
		if (n->right)
			sumNumbers(n->right, currNum, sum);
}
};