【数据结构与算法面试题】二叉树路径查找

void print_vector(vector<BinaryTreeNode *> &v){
	vector<BinaryTreeNode *>::iterator it;
	for (it = v.begin(); it != v.end(); it ++){
		printf("%d\t", (*it)->m_nValue);
	}
	printf("\n");
}

void pre_order_route(BinaryTreeNode *p, int num, vector<BinaryTreeNode *> &q, int &current){
	if (NULL == p) return;

	current += p->m_nValue;
	q.push_back(p);

	bool is_leaf = (NULL == p->m_pLeft) && (NULL == p->m_pRight);

	if (current == num && is_leaf){
		print_vector(q);
	}
	
	if (NULL != p->m_pLeft){
		pre_order_route(p->m_pLeft, num, q, current);
	}

	if (NULL != p->m_pRight){
		pre_order_route(p->m_pRight, num, q, current);
	}
	
	current -= (*(q.end() - 1))->m_nValue;
	q.pop_back();
}


void print_route(BinaryTreeNode *root, int num){
	vector<BinaryTreeNode *> q;// 用队列保存已经访问过的节点
	int current = 0;
	pre_order_route(root, num, q, current);
}