Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called______________.

Related Questions

• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• A connected graph T without any cycles is called _____________.
• Divide and conquer is an important algorithm design paradigm based on _______.
• How many types of insertion are performed in a binary tree?
• Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
• An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
• Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
• The worst case complexity of deleting any arbitrary node value element from heap is
• The topological sorting of any DAG can be done in time.
• Maximum degree in any vector in a graph with n vertices is ________.