数据结构地一点小问题!
请问如何做呢!我写了一下代码可是好像不对!
void linked::Insert(int Number)
{
Node* NewPointer;
NewPointer=(Node*)malloc(sizeof(Node));
NewPointer->Data=Number;
if (NodePointer==NULL)
{
NewPointer->Link=NodePointer;
NodePointer=NewPointer;
};
while(NodePointer!=NULL)
{
if (NewPointer->Data > NodePointer->Data && NewPointer->Data < NodePointer->Link->Data)
{
NodePointer->Link=NewPointer;
NewPointer->Link=NodePointer->Link;
};
if (NewPointer->Data < NodePointer->Data)
{
NewPointer->Link=NodePointer;
std::cout << "Front" << std::endl;
};
if (NewPointer->Data > NodePointer->Data && NodePointer->Link==NULL)
{
NewPointer->Link=NULL;
NodePointer->Link=NewPointer;
std::cout << "Last" << std::endl;
};
NodePointer=NodePointer->Link;
}
}