Stack Operations and Recursion Concepts

Front

What is the base case in recursion?

Back

A condition to end the recursive calls

Front

A recursive function must always have a base case.

Back

True

Front

What will be the output of the code?

Back

10

Front

Which of the following operations are supported by a stack? Insert and Delete, Enqueue and Dequeue, Push and Pop, Add and Remove

Back

Push and Pop

Front

What will be printed by the code? Answer in format "num, num" Example: 1, 1

Back

30, 20

Front

What is the time complexity for searching an element in a balanced BST?

Back

O(log n)

Front

A binary tree is a BST if for every node, the value of all nodes in its left subtree is less than the node, and the value of all nodes in its right subtree is greater.

Back

True

Front

What will be printed by the code? Enter in format "num, num". Example: 2, 2

Back

10, 20

Front

A singly linked list allows traversal in both directions.

Back

False

Front

What is the time complexity of inserting a node at the head of a singly linked list?

Back

O(1)