0 votes 0 votes I am getting 6 as the answer,but correct answer given is 5.Plese correct. Programming in C data-structures binary-search-tree algorithms + – rahul sharma 5 asked Dec 19, 2016 • recategorized Jul 6, 2022 by Lakshman Bhaiya rahul sharma 5 349 views answer comment Share Follow See 1 comment See all 1 1 comment reply Digvijaysingh Gautam commented Dec 19, 2016 reply Follow Share from the given tree the preorder and post order traversal are as follows A 50 27 16 4 12 34 29 44 88 65 52 77 93 92 B 12 4 16 29 44 34 27 52 77 65 92 93 88 50 so the longest subsequence is 16, 29, 44, 52, 77, 92. So I also think answer should be 6 2 votes 2 votes Please log in or register to add a comment.
