DSA Quiz

What is the purpose of the createtree function in the Binary Search Tree implementation?

• To create a new node in the tree

• To delete a node from the tree

• To traverse the tree in order

• To find a node in the tree

What does the inorder function do in the Binary Search Tree?

• Prints the nodes in ascending order

• Prints the nodes in descending order

• Prints the nodes in pre-order

• Prints the nodes in post-order

What is the time complexity of searching for a node in a Binary Search Tree?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which traversal method visits the root node before its children in a Binary Search Tree?

• Inorder

• Pre-order

• Post-order

• Level-order

What is the main characteristic of a Binary Search Tree?

• Each node has at most two children

• All nodes have the same value

• Nodes are arranged in a circular manner

• All nodes are connected in a single line

What is the primary advantage of using a linked list over an array?

• Dynamic size

• Faster access time

• Less memory usage

• Better cache locality

What is a common use case for a doubly linked list?

• Implementing a stack

• Implementing a queue

• Navigation in both directions

• Storing elements in sorted order

Which operation is not typically associated with a stack?

• Push

• Pop

• Peek

• Sort

In which scenario would a stack be the most appropriate data structure to use?

• Reversing a string

• Searching for an element

• Storing a list of items

• Implementing a priority queue

What is the primary function of a queue in data structures?

• To store elements in a last-in, first-out manner

• To store elements in a first-in, first-out manner

• To allow random access to elements

• To sort elements in ascending order