3 of the tree structure search method sample share _c language

Copy Code code as follows:

/**
Common search methods in 3 of trees
1. Two fork tree (only 0 and 1 per layer)
2. Full m fork tree (each layer has 0 to m-1)
3. Subset trees, also called all-ranked trees
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>

using namespace Std;

const int M = 20;

int n, m;
Int ans[m];
//Two fork tree
void dfs_two (int cur) {
 if (cur = = N) {
  for (int i = 0; i < n; i++) {
  & Nbsp;cout << Ans[i] << "";
  }
  cout << Endl;
  return;
 }
 ans[cur] = 1;
 dfs_two (cur + 1);
 ans[cur] = 0;
 dfs_two (cur + 1);
}

M Fork Tree
void dfs_m (int cur) {
if (cur = = N) {
for (int i = 0; i < n; i++) {
cout << Ans[i] << "";
}
cout << Endl;
return;
}
for (int i =0; i < n; i++) {
Ans[cur] = i;
Dfs_m (cur + 1);
}
}
BOOL Vis[m];
Subset Tree
void dfs_sub (int cur) {
if (cur = = N) {
for (int i = 0; i < n; i++) {
cout << Ans[i] << "";
}
cout << Endl;
Return
}
for (int i = 0; i < n; i++) {
if (false = = Vis[i]) {
Vis[i] = true;
Ans[cur] = i;
Dfs_sub (cur + 1);
Vis[i] = false;
}
}
}

int main () {

n = 5;
memset (ans,-1, sizeof (ans));
Memset (Vis, false, sizeof (VIS));
Dfs_two (0);//two fork Tree Search
Dfs_m (0)/full m fork Tree search
Dfs_sub (0);//subset Tree Search
return 0;
}