Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include "arbol.h"
- void arbolespejo(TNode *node){
- if (node==NULL)
- return;
- TNode *q;
- q=node->left;
- node->left=node->right;
- node->right=q;
- arbolespejo(node->left);
- arbolespejo(node->right);
- }
- int main(){
- TBinaryTree T;
- init_tree(&T);
- insert(&T,4);
- insert(&T,2);
- insert(&T,5);
- insert(&T,1);
- insert(&T,3);
- preorden(T.root);
- arbolespejo(T.root);
- printf("\n");
- preorden(T.root);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement