二叉树中寻找最大值

#include <iostream>
#include <queue>

struct node
{
	int data;
	node* left;
	node* right;
	node(int _data, node* _left, node* _right)
	{
		data = _data;
		left = _left;
		right = _right;
	}
};

int findLargest(node* n)
{
	if(!n)
		return -1;
	int left = findLargest(n->left);
	int right = findLargest(n->right);
	return std::max(n->data, std::max(right, left));
}

int main()
{
	node* n7 = new node(7, NULL, NULL);
	node* n6 = new node(6, NULL, NULL);
	node* n5 = new node(5, NULL, NULL);
	node* n4 = new node(4, NULL, NULL);
	node* n3 = new node(3, n6, n7);
	node* n2 = new node(2, n4, n5);
	node* n1 = new node(1, n2, n3);
	node* root = n1;

	std::queue<node*> q;
	q.push(root);
	q.push(NULL);

	int res = findLargest(root);
	printf("Max value = %d", res);

	return 0;

}