8 8 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 4.6k views answer comment Share Follow Print See 1 comment 1 1 comment reply shekhar chauhan commented Jul 4, 2016 reply Follow flag Almost Similar Question ISRO2016-39 0 0 replyShare Please log in or register to add a comment.
Best answer 6 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 1 1 comment reply shekhar chauhan commented Jul 11, 2016 reply Follow flag @kapil it could be o(n) in case of skewed tree .... 2 2 replyShare Please log in or register to add a comment.
0 0 votes If we consider Balanced Search Tree then option (B) search tree ,is True. Warrior answered May 3, 2017 Warrior comment Share Follow 0 reply Please log in or register to add a comment.