跳到主要内容
版本：Next

tree遍历

一、遍历要求：​

1.利用给定的数据生成对应的树

2.查找目标数据，匹配规则是：结点数据需包括目前数据的所有字符，包括重复的字符，不考虑目标字符串顺序

3.计数并打印包括找到的结点的全路径（到叶子结点）的个数

二、示例数据​

  // pair，第一个字符串是第二个字符串的子节点，暂定输入的子节点字符不会重复，父节点可以重复
  vector<pair<string, string>> belongToList{ vector<pair<string, string>> belongToList{
      {"ACD", "C"}, {"DCA", "C"},  {"AD", "AH"},  {"EF", "ACD"},
      {"C", "AH"},  {"CD", "AD"},  {"GH", "ACD"}, {"A", "DCA"},{"CF", "DCA"},
      {"B", "DCA"}, {"CDE", "AC"}, {"E", "AC"},   {"EG", "AG"}};
  const string target = "CD";

三、生成的样例树​

四、c++ 的树结构​

/cpp/algorithm/tree/tree.h

五、生成树类​

/cpp/algorithm/tree/data_to_tree.h

六、结果输出​

path0:CD->AD->AH
path1:EF->ACD->C->AH
path2:GH->ACD->C->AH
path3:A->DCA->C->AH
path4:CF->DCA->C->AH
path5:B->DCA->C->AH
path6:CDE->AC
the count of allPath which include "CD":7