자바 링크드리스트

소개글

자바 링크드리스트에 대한 보고서 자료입니다.

목차

<main>

<linkedlist>

<node>

본문내용

ewName))
{
if(listHead==i)
{
if(listHead==listTail)
{
listHead=null;
listTail=null;
}
listHead=i.right;
return 0;
}
else if(i==listTail)
{
listTail=null;
before.right = listTail;
return 0;
}
before.right = i.right;
next.left=i.left;
return 0;
}
}
return 0;
}
public void RightaddNode(String name, String phone, String address, String newName)
{
Node i;
Node next;
Node inNode = new Node(name, phone, address, null, null);
for(i=listHead; i!=null; i=i.right)
{
if(i.name.equals(newName))
{
if(i.name.equals(listTail.name))
{
addNode(name,phone,address);
}
else
{
next=i.right;
next.left = inNode;
inNode.right = next;
i.right = inNode;
inNode.left = i;
inNode.name = name;
inNode.phone = phone;
inNode.address = address;
}
}
}
}
public void LeftaddNode(String name, String phone, String address, String newName)
{
Node i;
Node before;
Node inNode = new Node(name, phone, address, null, null);
for(i=listHead; i!=null; i=i.right)
{
if(i.name.equals(newName))
{
if(i==listHead)
{
i.left = inNode;
inNode.right = i;
listHead=listHead.left;
inNode.name = name;
inNode.phone = phone;
inNode.address = address;
}
else
{
before=i.left;
before.right = inNode;
inNode.left = before;
inNode.right = i;
i.left=inNode;
inNode.name = name;
inNode.phone = phone;
inNode.address = address;
}
}
}
}
public void show()
{
Node i;
for(i=listHead; i!=null; i=i.right)
{
System.out.println();
System.out.println("이름 : " + i.name);
System.out.println("번호 : " + i.phone);
System.out.println("주소 : " + i.address);
System.out.println();
}
}
}

class Node
{
String name;
String phone;
String address;
Node left=null;
Node right =null;
public Node(String name, String phone, String address, Node left, Node right)
{
this.name = name;
this.phone = phone;
this.address = address;
this.left = left;
this.right = right;
}
}

키워드

자바,   링크,   링크드리스트