I just started programming in general and started with
Java, in an assignment I got I need to find the longest increasing path of a binary search tree of integer. however I have no idea how to carry it out. I know how to count the longest path of a binary search tree, just not when you need to find the path that's the longest with the values increasing.
the part I am stuck with is that my code only counts the longest path of the right of the root node