[Solved] Can we solve the longest increasing subsequence prob by designing the binary search tree and traverse its longest right?

Can we solve the longest increasing subsequence prob by designing the binary search tree and traverse its longest right?

solved Can we solve the longest increasing subsequence prob by designing the binary search tree and traverse its longest right?