fssssssss的专栏

树的算法，用递归很方便，尽管复杂度可能较高。 using System; using System.Collections.Generic; using System.Text; namespace ConsoleApplication1 { class Node { public Node left; public Node

#include #include #include using namespace std; class Node { public: Node(char data,Node *left,Node *right):data(data),left(left),right(right),flag(false){} char data; Node *left,*right;

#include #include #include using namespace std; class Node { public: Node(string data) { this->data=data; begin=0; finish=0; color="white"; p=NULL; } string data; int begin; int finish