#include<stdio.h>
using namespace std;
struct TreeNode{
int val;
TreeNode *left;
TreeNode *right;
//构造函数
TreeNode(int x):val(x),left(NULL),right(NULL){
}
};
void preorder_print(TreeNode *node,int layer){//正在遍历的节点,当前节点的层数
if(!node){//开始遍历节点
return;
}
for(int i=0;i<layer;i++){
printf("-----");//根据结点的层数,打印相应数量的-
}
printf("[%d]\n",node->val);
preorder_print(node->left,layer+1);
preorder_print(node->right,layer+1);
}
int main(){
TreeNode a(1);
TreeNode b(2);
TreeNode c(3);
TreeNode d(4);
TreeNode e(5);
TreeNode f(6);
a.left=&b;
a.right=&c;
b.left=&d;
b.right=&e;
c.right=&f;
preorder_print(&a,0);
return 0;
}
由此以后可以通过方法构造树