标签:
递归实现:
#include<iostream> using namespace std; typedef struct node { struct node *leftChild; struct node *rightChild; char data; }BiTreeNode, *BiTree; void createBiTree(BiTree &T) { char c; cin >> c; if(‘#‘ == c) T = NULL; else { T = new BiTreeNode; T->data = c; createBiTree(T->leftChild); createBiTree(T->rightChild); } } int main() { BiTree T; createBiTree(T); return 0; }
标签:
原文地址:http://www.cnblogs.com/dongzhuangdian/p/5059901.html