Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include "tree.h"
- int minInTree2(TNode *node);
- int minInTree(TTree *tree);
- int inRange(TTree *tree, int a, int b);
- int maxInTree(TTree *tree);
- int maxInTree2(TNode *node);
- int main(){
- TTree arbol;
- crearArbol(&arbol);
- insertar(&arbol,15);
- insertar(&arbol,6);
- insertar(&arbol,3);
- insertar(&arbol,1);
- insertar(&arbol,4);
- insertar(&arbol,9);
- insertar(&arbol,7);
- insertar(&arbol,12);
- insertar(&arbol,20);
- insertar(&arbol,18);
- insertar(&arbol,24);
- insertar(&arbol,17);
- printf("%d\n", inRange(&arbol,1,24));
- return 0;
- }
- int inRange(TTree *tree, int a, int b){
- int min = minInTree(tree);
- int max = maxInTree(tree);
- if(a>=min && b<=max)
- return 1;
- return 0;
- }
- int minInTree(TTree *tree){
- if(tree->root == NULL)
- return -1;
- return minInTree2(tree->root);
- }
- int minInTree2(TNode *node){
- if(node->der == NULL)
- return node->info;
- return minInTree2(node->izq);
- }
- int maxInTree(TTree *tree){
- if(tree->root == NULL)
- return -1;
- return maxInTree2(tree->root);
- }
- int maxInTree2(TNode *node){
- if(node->izq == NULL)
- return node->info;
- return maxInTree2(node->der);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement