BST Short version

import java.util.*;
public class BinarySearchTree {
    public static class Node {
        int value;
        Node left, right;
        public Node(int value) { this.value = value;}
    }
    Node root = null;
    public void insert(int value) {
        root = insert(root, value);
    }
    private Node insert(Node root, int value) {
        if (root == null) return new Node(value);
        if (value <= root.value) root.left = insert(root.left, value);
        else root.right = insert(root.right, value);
        return root;
    }
    private void FindDistance(Node root, int small, int big) {
        if (root == null) return;
        List<Node> p1 = new ArrayList<Node>();
        List<Node> p2 = new ArrayList<Node>();
        boolean res1 = true, res2 = true;
        if (big == root.value) {
            res1 &= FindPath(root.left, small, p1);
            p2.add(root);
        }
        else if (small == root.value) {
            p1.add(root);
            res2 &= FindPath(root.right, big, p2);
        }
        else if (big < root.value) FindDistance(root.left, small, big);
        else if (small > root.value) FindDistance(root.right, small, big);
        else if (small < root.value && big > root.value) {
            p1.add(root);
            res1 &= FindPath(root.left, small, p1);
            res2 &= FindPath(root.right, big, p2);
        }
        if (!res1 || !res2) {
            System.out.println("does not contain this node in binary search tree");
            return;
        }
        for (int i = p1.size() - 1; i >= 0; i--) System.out.print(p1.get(i).value + "->");
        for (int i = 0;i < p2.size() - 1; i++) System.out.print(p2.get(i).value + "->");
        System.out.println(p2.get(p2.size() - 1).value);
    }
    private boolean FindPath(Node root, int val, List<Node> path) {
        if (root == null) return false;
        path.add(root);
        if (root.value == val) return true;
        if (root.value > val) return FindPath(root.left, val, path);
        else return FindPath(root.right, val, path);
    }
    public void FindDistance(int a, int b) {
        if (a > b) FindDistance(root, b, a);
        else FindDistance(root, b, a);
    }
}