karolik

Hello, I am getting a linking error, and I'm not sure what its referring to. Here is the error 1>Main.obj : error LNK2019: unresolved external symbol "public: void __thiscall BinaryHeap,class std::allocator > >,class Comp,class std::allocator > > >::insert(class Item,class std::allocator > > const &)" (?insert@?$BinaryHeap@V?$Item@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@@V?$Comp@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@@@@QAEXABV?$Item@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@@@Z) referenced in function "public: void …

What is the difference between the individual search costs, and the average search costs of a perfect binary search tree and a linear one. I'm supposed to find the big oh notation for each, but I can't tell the difference. =/

So I have a program that reads data/text files, with 1 number on each line and makes a binary search tree from it. When i insert a node, there should be two data variables updated, searchcost and key.. Key being the actual number of the element, and the searchcost is …

Hi, here is the thing, I'm trying to make my university grading table on C++, when i fill in the grades it should tell me what i have accumulate. the thing is that when i insert the text grades it shows a zero when i click the buttom. the math …

So I'm trying to solve the relation for f(n)=f(n/2)*f(n/2)+1 Would that be T(n) = T(n/2^k)*T(n/2^k) + kc . Then when you set n/2^k=1. k=logn. But then i get T(1)*T(1)+logn*c. I am not sure if that is right.

So I made a template...I tried declaring a string linkedlist like so... [CODE]LinkedList<string> str; [/CODE] Then i called the function insertLast to insert a string called hello..like so... [CODE]str.insertLast("hello")[/CODE] Then it gives me null pointer error...I cannot see how there can be a null pointer...help would be appreciated..Here is the …

So i have Class Parser and in this class is constructor [CODE]Parser(string s){ // constructor tokens = s.c_str(); // convert to a C string opStack.push(END); // initialize opStack }[/CODE] tokens was defined as const char *tokens in private ; That is in the parser.h file However when i try to …

So I have a LinkedQueue which is a queue that is implemented by LinkedList. I need to overload the = operator for LinkedQueue. [CODE]LinkedQueue& LinkedQueue::operator=(LinkedQueue& queue) { return *this; }[/CODE] As you can see Linked Queue is const...the problem is that in order to copy the content from queue to …

So i called my Linked list destructor [CODE] ~LinkedList() { ListNode *current = head; ListNode *nextnode; while(current!=NULL){ nextnode=current->next; delete current; current=nextnode; }[/CODE] and i get.an error...._BLOCK_TYPE_IS_VALID(pHead->nBlockuse) for some reason it doesn't like the "delete current"...I could use some help...thanks.

So I'm trying to find a way to basically generate 100 numbers from 0 to 99 in random order with no duplicates. This is my code, and as you can see it displays 100 numbers but....some are duplicates. [CODE] srand((unsigned)time(0)); for (int count = 0; count < 100; count++) { …