Intersection of two sorted linked list

intersectionSortedLinkedList.java

private Node getIntersectedLinkedList(Node first, Node second){
		Node ptr = first;
		Node ptr1 = second;
		Node previous = null;
		Node firstIntersectedNode = null;
			while (ptr != null) {
				ptr1=second;
				while (ptr1!= null && ptr.getValue() != ptr1.getValue() ) {
					ptr1 = ptr1.getNext();
				}
				if(ptr1 !=null){
					Node node = new Node();
					if (firstIntersectedNode == null) {
						firstIntersectedNode = node;
					}
					node.setValue(ptr.getValue());
					if (previous != null) {
						previous.setNext(node);
					}
					previous = node;
				}
				ptr = ptr.getNext();
			}
		
		return firstIntersectedNode;