NodeDepths problem in algoexpertsolution
ques: Need to find the depth of the tree.
below is the solution

int nodeDepth(TreeNode t, int ldepth, int rdepth) {

	if (t == null) {
		return 0;
	} else {

		ldepth = nodeDepth(t.left, ldepth, rdepth) + 1;

		rdepth = nodeDepth(t.right, ldepth, rdepth) + 1;

		if (ldepth > rdepth) {
			return ldepth;
		} else {
			return rdepth;
		}
	}
}

A folder containing the solutions to the data structures and algorithms problems in Cracking the Coding Interview. I think it may be useful for people testing their solutions. Since there are many approaches they can just copy/paste the solutions here and compare their code's behavior. Or, they can just reference solutions from here for better accessability (desk can get cramped with such a large book).
I am currently working my way through the book and can upload solutions as I go.

You have added solutions to algoexpert problems but you haven't added any questions. could you please add them? I couldn't find questions anywhere. Questions refer to problem statement of questions.

below link has algo expert questions.
https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Questions/