A string `s` consists of x, y and if x is an empty string then y is called as___________.

Related Questions

• In a stack, if a user tries to remove an element from empty stack it is called
• Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
• ________ is the situation where data-structure is empty.
• The special list which consists of unused memory space is called __________.
• The string with zero characters is called___________.
• The length of the string can be listed as an additional item in _____________.
• In a graph G if e=(u,v), then u and v are called ___________.
• An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
• Pushing an element into stack already having five elements and stack size of 5, then stack becomes
• The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be