java模拟实现数组链表树图等数据结构

package myList; class Node{ Integer data; Node next; } public class MyLinkedList { Node root; int size; public int getSize() { return size; } public MyLinkedList() { root = new Node(); } /* * 插入第一个 */ public void addFirst(int num){ Node node = new Node(); node.data = num; node.next = root; root = node; size++; } /* * 插入 */ public void add(int index,Integer num){ if(index < 0 || index > size+1){ throw new IndexOutOfBoundsException("下标越界"); } if(index == size+1){ add(num); //直接增加到最后 return; }else if(index == 0){ addFirst(num); return; } int i = 0; Node temp = root; while(i<index-1){ temp = temp.next; i++; } Node node = new Node(); node.data = num; System.out.println(temp.data); node.next = temp.next; temp.next = node; size++; } /* * 增加 */ public void add(Integer num){ if(root.data == null){ root.data = num; }else{ addNode(num); } size++; } private void addNode(Integer num){ // Node temp = root; // while( temp != null){ // temp = temp.next; // } // temp = new Node(); // temp.data = num; Node temp = root; while( temp.next != null){ temp = temp.next; } temp.next = new Node(); temp.next.data = num; } /* * 得到 */ public int get(int index){ if(index < 0 || index > size){ throw new IndexOutOfBoundsException("下标越界"); } int i = 0; Node temp = root; while(i<index){ temp = temp.next; i++; } return temp.data; } /* * 删除 */ public void remove(int index){ if(index < 0 || index >= size){ throw new IndexOutOfBoundsException("下标越界"); } //一出第一个 if(index == 0){ root = root.next; size--; return; } int i = 0; Node temp = root; while(i<index-1){ temp = temp.next; i++; } temp.next = temp.next.next; size--; } }