5 votes 5 votes Access time of the symbolic table will be logarithmic if it is implemented by Linear list Search tree Hash table Self organization list Algorithms isro2016 algorithms symbol-table + – Desert_Warrior asked Jul 3, 2016 recategorized Dec 9, 2022 by Lakshman Bhaiya Desert_Warrior 3.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply shekhar chauhan commented Jul 4, 2016 reply Follow Share Almost Similar Question ISRO2016-39 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes B) search tree ==> O(logn) Kapil answered Jul 3, 2016 selected Mar 7, 2018 by srestha Kapil comment Share Follow See 1 comment See all 1 1 comment reply shekhar chauhan commented Jul 11, 2016 reply Follow Share @kapil it could be o(n) in case of skewed tree .... 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes If we consider Balanced Search Tree then option (B) search tree ,is True. Warrior answered May 3, 2017 Warrior comment Share Follow See all 0 reply Please log in or register to add a comment.