template<class T> T TreeNode<T>:: getdata() const { return data; }//end getdata

Transcription

1 #pragma once template<class T> class BinarySearchTree; template<class T> class TreeNode friend class BinarySearchTree<T>; public: TreeNode(); TreeNode(const T &info, TreeNode<T> *left, TreeNode<T> *right); T getdata() const; private: T data; TreeNode<T> *leftchildptr; TreeNode<T> *rightchildptr; };//end class tree template<class T> TreeNode<T>::TreeNode() leftchildptr=null: rightchildptr = NULL; }//end TreeNode TreeNodeBST.h

2 template<class T> TreeNode<T>::TreeNode(const T &info, TreeNode<T> *left, TreeNode<T> *right) data= info; leftchildptr= left; rightchildptr = right; } // end TreeNode template<class T> T TreeNode<T>:: getdata() const return data; }//end getdata

3 #pragma once #include "TreeNodeBST.h" #include <iostream> #include <cassert> using namespace ::std; BinarySearchTree.h template <class T> class BinarySearchTree private: TreeNode<T> *root; public: BinarySearchTree(); BinarySearchTree(const BinarySearchTree<T> &temptree); ~BinarySearchTree(); bool isempty() const; void searchtreeinsert(const T &newitem); void searchtreedelete(t searchitem); void searchtreeretrieve(t searchkey, T &treeitem); void preordertransverse() const;

4 void postordertransverse() const; BinarySearchTree<T>& BinarySearchTree<T>::operator = (const BinarySearchTree<T>&tempTree); protected: void insertitem(treenode<t> *& treeptr, const T &newitem); void deleteitem(treenode<t> *&, T searchkey); void deletenodeitem(treenode<t> *&nodeptr); void processleftmost(treenode<t> *&nodeptr, T &treeitem); TreeNode<T> *roottree() const; void setrootptr(treenode <T> *newroot); void getchildptrs(treenode <T> *temproot,treenode <T> *&templeftchild, TreeNode <T>*&tempRightChild) const; void setchildptrs(treenode <T> *temproot,treenode <T> *&templeftchild, TreeNode <T>*&tempRightChild) ; void preorder(treenode<t> *temproot) const; void postorder(treenode<t> *temproot) const; void inorder(treenode<t> *temproot ) const; }; //end BinarySearchTree class

5 BinarySearchTree<T>::BinarySearchTree():root(NULL) }//end constructor //Constructor que hace una replica del contenido de un arbol BinarySearchTree<T>::BinarySearchTree(const BinarySearchTree<T> &temptree) copytree(temptree.root,root); }//end constructor //Destruye el arbol binario BinarySearchTree<T>::~BinarySearchTree() destroytree(root); }//end destructor //Verifica si el arbol esta vacio template <class T> bool BinarySearchTree<T>::isEmpty() const return(root == NULL); } //end isempty //Anade un nodo nuevo al arbol void BinarySearchTree<T>::searchTreeInsert(const T &newitem) insertitem(root,newitem); }//end searchtreeinsert

6 //Elimina un nodo del arbol void BinarySearchTree<T>::searchTreeDelete(T searchitem) deleteitem(root, searchitem); }//end serachtreedelete //Retorna la direccion del nodo buscado void BinarySearchTree<T>::searchTreeRetrieve(T searchkey, T &treeitem) retrieveitem(root, searchkey,treeitem); }//end searchtreeretrieve //Recorrido del arbol void BinarySearchTree<T>::preOrderTransverse() const preorder(root); }//end preordertransverse

7 //Recorrido del arbol void BinarySearchTree<T>::postOrderTransverse() const postorder(root); } //end porordertransverse //Recorrido del arbol template <class T> void BinarySearchTree<T>::inOrderTransverse() const inorder(root); }//end inordertransverse

8 //El nodo se anade a la hoja izquierda si el menor y a la derecha si es mayor template <class T> void BinarySearchTree<T>::insertItem(TreeNode<T> *&treeptr, const T &newitem) if(treeptr == NULL) treeptr = new TreeNode<T> (newitem,null,null); if(treeptr==null) else cout<<"no hay memoria suficiente\n"; if(newitem < treeptr->data) }//endif else insertitem(treeptr->leftchildptr, newitem); insertitem(treeptr->rightchildptr, newitem); }//end insertitem

9 //Elimina un nodo del arbol void BinarySearchTree<T>::deleteItem(TreeNode<T> *&treeptr, T searchkey) if(treeptr == NULL) cout<<"delete failed\n"; } else if(searchkey == treeptr->data) deletenodeitem(treeptr); }//endif else if(searchkey < treeptr->data) deleteitem(treeptr->leftchildptr,searchkey); else deleteitem(treeptr->rightchildptr,searchkey); }//end deleteitem

10 void BinarySearchTree<T>::deleteNodeItem(TreeNode<T> *&nodeptr) TreeNode<T> *delptr; T replecementitem; if((nodeptr->leftchildptr==null) && (nodeptr->rightchildptr==null)) //Es una hoja delete nodeptr; nodeptr = NULL; } //end if else if(nodeptr->leftchildptr==null) //el nodo solo tenia un hijo derecho delptr = nodeptr; nodeptr = nodeptr->rightchildptr; delptr-> rightchildptr= NULL; delete delptr; } //end if

11 else if(nodeptr->rightchildptr==null) //el nodo solo tenia un hijo izquierdo delptr = nodeptr; nodeptr = nodeptr->leftchildptr; delptr-> leftchildptr= NULL; delete delptr; else //el nodo tiene dos hijos, busca la hoja mas izquierda del subarbol derecho processleftmost(nodeptr->rightchildptr, replecementitem); nodeptr->data = replecementitem; }//end deletenodeitem

12 void BinarySearchTree<T>::processLeftmost(TreeNode<T> *&nodeptr, T &treeitem) if(nodeptr->leftchildptr==null) //el nodo solo tenia un hijo derecho treeitem = nodeptr->data; TreeNode <T> *delptr = nodeptr; nodeptr = nodeptr->rightchildptr; delptr->rightchildptr = NULL; delete delptr; } //endif else processleftmost(nodeptr->leftchildptr, treeitem); }//end processleftmost void BinarySearchTree<T>::retrieveItem(TreeNode<T> *&treeptr, T searchkey, T &treeitem) const if(treeptr == NULL) cout<<"search key not found\n"; } //end if else if(searchkey == treeptr->data) treeitem = treeptr->data; }//endif else if(searchkey < treeptr->data) retrieveitem(treeptr->leftchildptr,searchkey, treeitem); else retrieveitem(treeptr->rightchildptr,searchkey,treeitem);

13 //Realiza una replica de un arbol con el operador igual BinarySearchTree<T> & BinarySearchTree<T>::operator = (const BinarySearchTree<T> &temptree) if(this!= &temptree) destroytree(temptree); copytree(temptree.root,root); return *this; }//end operator=

14 //Realiza una replica del contenido del arbol void BinarySearchTree<T>::copyTree(TreeNode <T> *temptree,treenode <T> *&newtree) const if(temptree!= NULL) newtree = new TreeNode<T> (temptree->data, NULL,NULL); if(newtree == NULL) cout<<"no hay memoria suficiente\n"; } //end if else copy(temptree->leftchildptr, newtree->leftchildptr); copy(temptree->rightchildptr, newtree->rightchildptr); else newtree = NULL; }//end copytree

15 void BinarySearchTree<T>::destroyTree(TreeNode <T> *&temptree) if(temptree!= NULL) destroytree(temptree->leftchildptr); destroytree(temptree->rightchildptr); delete temptree; }//end destroytree TreeNode<T> * BinarySearchTree<T>::rootTree() const return root; }//end roottree

16 void BinarySearchTree<T>::setRootPtr(TreeNode <T> *newroot) root = newroot; }//end setrootptr void BinarySearchTree<T>::getChildPtrs(TreeNode <T> *temproot, TreeNode <T> *&templeftchild, TreeNode <T>*&tempRightChild) const templeftchild = temproot->leftchildptr; temprightchild= temproot->rightchildptr; }//end getchildptrs

17 void BinarySearchTree<T>::setChildPtrs(TreeNode <T> *temproot,treenode <T>*&tempLeftChild, TreeNode <T>*&tempRightChild) temproot->leftchildptr = templeftchild; temproot->rightchildptr = temprightchild; }//end setchildptrs void BinarySearchTree<T>::preOrder(TreeNode<T> *temproot) const if(temproot!= NULL) cout<<temproot->data<<" "; preorder(temproot->leftchildptr); preorder(temproot->rightchildptr); }//end preorder void BinarySearchTree<T>::postOrder(TreeNode<T> *temproot) const if(temproot!= NULL) postorder(temproot->leftchildptr); postorder(temproot->rightchildptr); cout<<temproot->data<<" "; }//end pororder

18 void BinarySearchTree<T>::inOrder(TreeNode<T> *temproot) const if(temproot!= NULL) inorder(temproot->leftchildptr); cout<<temproot->data<<" "; inorder(temproot->rightchildptr); }//end inorder

19 #include "BinarySearchTree.h" #include <iostream> using namespace ::std; int main() BinarySearchTree<int> tree; BinarySearchTree_main.cpp tree.searchtreeinsert(60); tree.searchtreeinsert(20); tree.searchtreeinsert(10); tree.searchtreeinsert(40); tree.searchtreeinsert(30); tree.searchtreeinsert(50); tree.searchtreeinsert(70); cout<<"\npreorder:"; tree.preordertransverse(); cout<<"\ninorder:"; tree.inordertransverse(); cout<<"\npostorder:"; tree.postordertransverse(); cout<<"\n"; /* Preorder: Inorder: Postorder: Press any key to continue...*/ return 0; }//end main