public Node successor(Node q) {
            depthSum = treeNodes = 0;
            Node rightSuccessor = getSuccessorLeft(q.right, 0);
            double rightDepthSum = depthSum;
            depthSum = 0;
            int rightTreeNodes = treeNodes;
            treeNodes = 0;

            Node leftSuccessor = getSuccessorRight(q.leftChild, 0);
            double leftMiddle = depthSum / treeNodes;
            double rightMiddle = rightDepthSum / rightTreeNodes;
            //System.out.println("<"+leftMiddle+","+rightMiddle+">");
            if (leftMiddle < rightMiddle) {
                R++;
                return rightSuccessor;
            }
            L++;
            return leftSuccessor;
        }

        public Node getSuccessorLeft(Node node, int depth) {
            if (node == null) return null;
            Node result = getSuccessorLeft(node.leftChild, depth + 1);
            treeNodes++;
            depthSum += depth;
            getSuccessorLeft(node.right, depth + 1);
            return result == null ? node : result;
        }

        public Node getSuccessorRight(Node node, int depth) {
            if (node == null) return null;
            getSuccessorRight(node.leftChild, depth + 1);
            treeNodes++;
            depthSum += depth;
            Node result = getSuccessorRight(node.right, depth + 1);
            return result == null ? node : result;
        }