C++ (Cpp) BinaryNode::getItem 예제들

예제 #1

파일: BinaryNodeTree.cpp 프로젝트: kylienic/CTP-250

BinaryNode<ItemType>* BinaryNodeTree<ItemType>::moveValuesUpTree(BinaryNode<ItemType>* subTreePtr)
{
   BinaryNode<ItemType>* leftPtr = subTreePtr->getLeftChildPtr();
   BinaryNode<ItemType>* rightPtr = subTreePtr->getRightChildPtr();
   int leftHeight = getHeightHelper(leftPtr);
   int rightHeight = getHeightHelper(rightPtr);
   if (leftHeight > rightHeight)
   {
      subTreePtr->setItem(leftPtr->getItem());
      leftPtr = moveValuesUpTree(leftPtr);
      subTreePtr->setLeftChildPtr(leftPtr);
      return subTreePtr;
   }
   else 
   {
      if (rightPtr != nullptr)
      {
         subTreePtr->setItem(rightPtr->getItem());
         rightPtr =moveValuesUpTree(rightPtr);         
         subTreePtr->setRightChildPtr(rightPtr);
         return subTreePtr;
      }
      else 
      {
         //this was a leaf!
         // value not important
         delete subTreePtr;
         return nullptr;
      }  // end if
   }  // end if   
}  // end moveValuesUpTree

예제 #2

파일: BinaryNodeTree.cpp 프로젝트: kylienic/CTP-250

ItemType BinaryNodeTree<ItemType>::getEntry(const ItemType& anEntry) const throw(NotFoundException)
{
   bool isSuccessful = false;
   BinaryNode<ItemType>* binaryNodePtr = findNode(rootPtr, anEntry, isSuccessful);
   
   if (isSuccessful)
      return binaryNodePtr->getItem(); 
   else 
      throw NotFoundException("Entry not found in tree!");
}  // end getEntry

예제 #3

파일: assignment11.cpp 프로젝트: etzelm/Binary-Search-Tree-Implementation

 BinaryNode<ItemType>* moveValuesUpTree(BinaryNode<ItemType>* subTreePtr) {
     BinaryNode<ItemType>* leftPtr = subTreePtr->getLeftChildPtr();
     BinaryNode<ItemType>* rightPtr = subTreePtr->getRightChildPtr();
     int leftHeight = getHeightHelper(leftPtr);
     int rightHeight = getHeightHelper(rightPtr);
     if (leftHeight > rightHeight) {
         subTreePtr->setItem(leftPtr->getItem());
         leftPtr = moveValuesUpTree(leftPtr);
         subTreePtr->setLeftChildPtr(leftPtr);
         return subTreePtr;
     }
     else {
         if (rightPtr != nullptr) {
             subTreePtr->setItem(rightPtr->getItem());
             rightPtr =moveValuesUpTree(rightPtr);
             subTreePtr->setRightChildPtr(rightPtr);
             return subTreePtr;
         }
         else {
             delete subTreePtr;
             return nullptr;
         }
     }
 }

예제 #4

파일: assignment11.cpp 프로젝트: etzelm/Binary-Search-Tree-Implementation

     ItemType getEntry(const ItemType& anEntry) const {
     BinaryNode<ItemType>* nodeWithEntry = findNode(rootPtr, anEntry);
     if (nodeWithEntry == nullptr) cout << "NotFoundException - Entry not found in tree.\n";
     else return nodeWithEntry->getItem();
 }

예제 #5

파일: assignment11.cpp 프로젝트: etzelm/Binary-Search-Tree-Implementation

 ItemType getRootData() const {
     if (isEmpty()) cout << "PrecondViolatedExcep - getRootData() called with empty tree.\n";
     return rootPtr->getItem();
 }

예제 #6

파일: assignment11.cpp 프로젝트: etzelm/Binary-Search-Tree-Implementation

 ItemType getEntry(const ItemType& anEntry) const {
     bool isSuccessful = false;
     BinaryNode<ItemType>* binaryNodePtr = findNode(rootPtr, anEntry, isSuccessful);
     if (isSuccessful) return binaryNodePtr->getItem();
     else cout << "NotFoundException - Entry not found in tree!\n";
 }