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

With your solution do you keep the following tree in mind:

You need something to define what a path in a tree is. You could keep track of the nodes or the start and end node.

"Any fool can write code that a computer can understand. Good programmers write code that humans can understand." --- Martin Fowler
Please correct my English.

This question is too difficult for "beginning", so I shall move it.

jack web
Greenhorn

Joined: Mar 13, 2011
Posts: 5

posted

0

out of curiosity what is the cost of find the leaves in a binary tree in big O notation

Stephan van Hulst
Bartender

Joined: Sep 20, 2010
Posts: 3371

9

posted

0

Here's a tip:

For any binary tree, the length of the longest increasing path would be the length of the longest increasing path of either the left subtree, or the right subtree, whichever is bigger, plus 1 if the path starts at the root of the subtree, and the root of the parent is smaller than the root of the subtree.