The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Access time of the symbol table will be logarithmic, if it is implemented by a

(a) linear list

(b) search tree

(c) hash table

(d) none of the above
in Compiler Design by (103 points) | 23 views

i got this from GFG ( i have a doubt in this )

i didn't get the meaning of search tree, if it is really Binary Search tree, then how can we use BST here, i mean what is the criteria to say node A is less than node B etc.


1st page last para. I think identifiers are entered on basis of  ASCII code etc. I don't know clearly.

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,408 questions
53,593 answers
70,874 users