C/C++实现树操作的实例代码

判断两棵树是否一样

int same(tree t1, tree t2)
{
 if (count(t1) == count(t2))
 {
 if (t1->elem != t2->elem)
 return FALSE;
 if (t1->left != NULL && t2->left != NULL)
 same(t1->left, t2->left);
 if (t1->right != NULL && t2->right != NULL)
 same(t1->right, t2->right);
 return TRUE;
 }
 else return FALSE;
}

求树的高度

#define max(x, y) (x > y) ? x : y

int height(tree t)
{
 if (t == NULL)return -1;
 return 1 + max(height(t->right), height(t->left));
}

打印树中某值的层数

//明确函数功能：寻找放入的数的层数并打印
//确定尾：//找到特定值的节点 找到NULL 头：若是则打印，若不是则去左右子树寻找layer++，当孩子寻找完都没有时layer--
bool flag = false; //flag标记可以用于提前结束递归
void getTreeLayer(Node * root, int num, int &layer)
{
 if (root == NULL) return;
 if (flag == true) return;
 if (root->data == num) { 
 cout << "num值" << num << "的层数为：" << layer << endl; 
 flag = true; 
 return; 
 }
 layer++;
 getTreeLayer(root->lChild, num);
 getTreeLayer(root->rChild, num);
 layer--;
}

求节点的路径

vector<int> path;
bool flag = false; //flag标记可以用于提前结束递归
void getTreeLayer(Node * root, int num, int &layer)
{
 if (root == NULL) return;
 if (flag == true) return;
 if (root->data == num) { 
 for(int x : path)
 cout << x << " ";
 bool flag = true;
 return;
 }
 path.push_back();
 getTreeLayer(root->lChild, num);
 getTreeLayer(root->rChild, num);
 path.pop_back();
}

总结

以上所述是小编给大家介绍的C/C++实现树操作的实例代码，希望对大家有所帮助！