同学阿里三面面试官的一道面试题是:二叉树每个节点都保存一个整数,想要求所有节点数值之和,哪种遍历方式最快?
首先定义二叉树
struct Tree
{
int val;
Tree *left;
Tree *right;
Tree(){val = 0;left = NULL;right = NULL;};
};
Tree* constructTree(vector<int> &vect, int i)
{
if(i >= vect.size())
return NULL;
Tree *root = new Tree();
root->val = vect[i];
root->left = constructTree(vect, 2*i+1);
root->right = constructTree(vect, 2*i+2);
}
void releaseTree(Tree *root)
{
if(root == NULL)
return;
release(root->left);
release(root->right);
delete root;
}
二叉树有四种遍历方式,先序遍历、中序遍历、后序遍历、层次遍历。分别利用这些遍历方式进行二叉树所有元素求和:
一、 递归方式
层次遍历只能通过非递归的方式实现,下面只给出先序遍历、中序遍历、后续遍历的三种递归实现方式。
//递归的先序遍历求和
void frontTraverseSum(Tree *root, int &sum)
{
if(root == NULL)
return;
sum += root->val;
frontTraverseSum(root->left, sum);
frontTraverseSum(root->right, sum);
}
//递归的中序遍历求和
void middleTraverseSum(Tree *root, int &sum)
{
if(root == NULL)
return;
middleTraverseSum(root->left, sum);
sum += root->val;
middleTraverseSum(root->right, sum);
}
//递归的后续遍历求和
void backTraverseSum(Tree *root, int &sum)
{
if(root == NULL)
return;
backTraverseSum(root->left, sum);
backTraverseSum(root->right, sum);
sum += root->val;
}
二、 非递归方式
//非递归的先序遍历求和,并使用count统计入栈次数
void preTraverseSum(Tree *root, int &sum)
{
stack<Tree*> st;
Tree *p = root;
int count = 0;
while(p != NULL || !st.empty()) //当出栈到root的时候会出现栈为空的中间状态,所以p不为空的条件不能省略
{
while(p != NULL)
{
sum += p->val;
st.push(p);
count++;
p = p->left;
}
if(!st.empty())
{
p = st.top();
st.pop();
p = p->right;
}
}
cout << "pre st.push count: " << count << endl;
}
//非递归的中序遍历求和
void inTraverseSum(Tree *root, int &sum)
{
stack<Tree*> st;
Tree *p = root;
int count = 0;
while(p != NULL || !st.empty())
{
while(p != NULL)
{
st.push(p);
count++;
p = p->left;
}
if(!st.empty())
{
p = st.top();
st.pop();
sum += p->val;
p = p->right;
}
}
cout &