0 votes 0 votes Number of comparison made by algorithm that inserts values in the binary search tree?In the worst case for left or right skewed tree isn;t it o(n)? Programming in C binary-search-tree + – Sayan Das 1 asked Dec 6, 2016 Sayan Das 1 260 views answer comment Share Follow See 1 comment See all 1 1 comment reply shayal chhabra commented Dec 6, 2016 reply Follow Share yes it is. 0 votes 0 votes Please log in or register to add a comment.