java qusetion and data structure
up vote
-1
down vote
favorite
my question is How can i connect the first node , last node and new node when i add item in the beginning or at any position?thanks
public class LinkedList2 implements StudentInterface {
public Node FirstNode;
public Node LastNode;
int length;
public LinkedList2(){
clear();
}
public final void clear(){
FirstNode=null;
LastNode=null;
length=0;
}
public boolean isEmpty(){
return length==0;
}
private class Node{
private Object Data;
private Node next;
private Node(Object Item){
Data=Item;
next=null;
}
private Node(Object Item , Node NextNode){
Data=Item;
next=NextNode;
}
}
public boolean Add(Object Item){
Node newNode= new Node(Item);
if(isEmpty()){
here aremy problems-------> FirstNode=newNode;
here are my problems------->newNode.next=LastNode;
}else{
here are my problems------->FirstNode.next=newNode;
}
length++;
return true;
}
java linked-list
asked 9 mins ago
Mohammad W. Al-Shatarat
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
-1
down vote
favorite
my question is How can i connect the first node , last node and new node when i add item in the beginning or at any position?thanks
public class LinkedList2 implements StudentInterface {
public Node FirstNode;
public Node LastNode;
int length;
public LinkedList2(){
clear();
}
public final void clear(){
FirstNode=null;
LastNode=null;
length=0;
}
public boolean isEmpty(){
return length==0;
}
private class Node{
private Object Data;
private Node next;
private Node(Object Item){
Data=Item;
next=null;
}
private Node(Object Item , Node NextNode){
Data=Item;
next=NextNode;
}
}
public boolean Add(Object Item){
Node newNode= new Node(Item);
if(isEmpty()){
here aremy problems-------> FirstNode=newNode;
here are my problems------->newNode.next=LastNode;
}else{
here are my problems------->FirstNode.next=newNode;
}
length++;
return true;
}
java linked-list
asked 9 mins ago
Mohammad W. Al-Shatarat
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
my question is How can i connect the first node , last node and new node when i add item in the beginning or at any position?thanks
public class LinkedList2 implements StudentInterface {
public Node FirstNode;
public Node LastNode;
int length;
public LinkedList2(){
clear();
}
public final void clear(){
FirstNode=null;
LastNode=null;
length=0;
}
public boolean isEmpty(){
return length==0;
}
private class Node{
private Object Data;
private Node next;
private Node(Object Item){
Data=Item;
next=null;
}
private Node(Object Item , Node NextNode){
Data=Item;
next=NextNode;
}
}
public boolean Add(Object Item){
Node newNode= new Node(Item);
if(isEmpty()){
here aremy problems-------> FirstNode=newNode;
here are my problems------->newNode.next=LastNode;
}else{
here are my problems------->FirstNode.next=newNode;
}
length++;
return true;
}
java linked-list
asked 9 mins ago
Mohammad W. Al-Shatarat
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
my question is How can i connect the first node , last node and new node when i add item in the beginning or at any position?thanks
public class LinkedList2 implements StudentInterface {
public Node FirstNode;
public Node LastNode;
int length;
public LinkedList2(){
clear();
}
public final void clear(){
FirstNode=null;
LastNode=null;
length=0;
}
public boolean isEmpty(){
return length==0;
}
private class Node{
private Object Data;
private Node next;
private Node(Object Item){
Data=Item;
next=null;
}
private Node(Object Item , Node NextNode){
Data=Item;
next=NextNode;
}
}
public boolean Add(Object Item){
Node newNode= new Node(Item);
if(isEmpty()){
here aremy problems-------> FirstNode=newNode;
here are my problems------->newNode.next=LastNode;
}else{
here are my problems------->FirstNode.next=newNode;
}
length++;
return true;
}
java linked-list
java linked-list
asked 9 mins ago
Mohammad W. Al-Shatarat
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 mins ago
Mohammad W. Al-Shatarat
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 mins ago
Mohammad W. Al-Shatarat
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 mins ago
Mohammad W. Al-Shatarat
1
asked 9 mins ago
Mohammad W. Al-Shatarat
1
1
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Mohammad W. Al-Shatarat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Mohammad W. Al-Shatarat is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Mohammad W. Al-Shatarat is a new contributor. Be nice, and check out our Code of Conduct.
Mohammad W. Al-Shatarat is a new contributor. Be nice, and check out our Code of Conduct.
Mohammad W. Al-Shatarat is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f209131%2fjava-qusetion-and-data-structure%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
