Questions

- Which data structure uses LIFO (Last In, First Out) ordering?
- In binary search, what is the time complexity for finding an element in a sorted array?
- Which data structure is a tree where each internal node has exactly two children?
- What is the worst-case time complexity of the quicksort algorithm?
- Which data structure is a linear data structure where elements are inserted and removed based on the LIFO principle?
- What is the time complexity of inserting an element at the beginning of an array (shift operation)?
- Which sorting algorithm has a worst-case time complexity of O(n log n) and uses a divide and conquer strategy?
- In a binary search tree, what is the property that ensures all nodes in the left subtree have values less than the parent node, and all nodes in the right subtree have values greater than the parent node?
- Which data structure is a tree data structure where each node has at most two children, and each child node is labeled as either the 'left' or 'right' child?
- What is the time complexity of finding an element in a binary search tree with 'n' nodes in the worst-case scenario?