Professional Documents
Culture Documents
Tree Inorder
Tree Inorder
h>
char data;
node *left;
node *right;
};
node *root=NULL;
if((*root)==NULL){
node *baru;
baru->data = isi;
baru->left = NULL;
baru->right = NULL;
(*root)=baru;
if(root !=NULL) {
printf(“%c “, root->data);
preorder(root->left);
preorder(root->right);
}
if(root !=NULL) {
inorder(root->left);
printf(“%c “, root->data);
inorder(root->right);
if(root !=NULL) {
postorder(root->left);
postorder(root->right);
printf(“%c “, root->data);
main()
char kata;
Tambahnode(&root,kata=’R’);
Tambahnode(&root->left,kata=’A’);
Tambahnode(&root->left->left,kata=’S’);
Tambahnode(&root->left->left->left,kata=’I’);
Tambahnode(&root->left->left->right,kata=’T’);
Tambahnode(&root->right,kata=’E’);
preorder(root);
inorder(root);
postorder(root);