Added null check.

Author: RodneyShag

Chp. 02 - Linked Lists/_2_7_Intersection/Intersection.java

@@ -10,6 +10,9 @@
 
 public class Intersection {
  public static Integer findMergeNode(Node headA, Node headB) {
+ if (headA == null || headB == null) {
+ return null;
+ }
  Node currA = headA;
  Node currB = headB;
 

Chp. 17 - More Problems (Hard)/_17_20_Continuous_Median/ContinuousMedian.java

@@ -10,7 +10,7 @@
 
 public class ContinuousMedian {
  private static PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // maxHeap contains all SMALL elements
- private static PriorityQueue<Integer> minHeap = new PriorityQueue<>(); // minHeap contains all LARGE elements
+ private static PriorityQueue<Integer> minHeap = new PriorityQueue<>();  // minHeap contains all LARGE elements
 
  public static void addNum(int n) {
  if (maxHeap.isEmpty()) {