code: private boolean searchTreeAndAddNoNode(
              BinTree currentNode,
              int existingNodeID, int newNodeID, String newQuestAns,
              Decision decision) {
          if (currentNode.nodeID == existingNodeID) {
              // Found node
              if (currentNode.noBranch == null) currentNode.noBranch = new
                      BinTree(newNodeID,newQuestAns, decision);
              else {
                  System.out.println("WARNING: Overwriting previous node " +
                          "(id = " + currentNode.noBranch.nodeID +
                          ") linked to yes branch of node " +
                          existingNodeID);
                  currentNode.noBranch = new BinTree(newNodeID,newQuestAns, decision);
              }
              return(true);
          }
          else {
              // Try yes branch if it exists
              if (currentNode.yesBranch != null) {
                  if (searchTreeAndAddNoNode(currentNode.yesBranch,
                          existingNodeID,newNodeID,newQuestAns, decision)) {
                      return(true);
                  }
                  else {
                      // Try no branch if it exists
                      if (currentNode.noBranch != null) {
                          return(searchTreeAndAddNoNode(currentNode.noBranch,
                                  existingNodeID,newNodeID,newQuestAns, decision));
                      }
                      else return(false);	// Not found here
                  }
              }
              else return(false);	// Not found here
          }
      }
docs: /* SEARCH TREE AND ADD NO NODE