This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Leftlist Heap”.

**1. What is the fundamental operation on leftist heap?**

A) insertion**B) merging**

C) deletion

D) swapping

Explanation: Merge is one of the most basic operations on leftist heaps. A merge of a one-node heap with a larger heap is called an insertion process.

**2. A leftist heap is also said to be a binary heap.****A) true**

B) false

Explanation: The structural and ordering properties of a leftist heap are close to those of a binary heap. As a result, leftist heap is also known as binary heap.

**3. What is the efficiency of merge used in leftist heaps?**

A) O(N)

B) O(N log N)

C) O(M log N)**D) O(log N)**

Explanation: In a leftist heap, the efficiency of merge operations is found to be O( log N), which is the same in binary heaps.

**4. What is the node path length of a node with 0 or 1 child?**

A) 1

B) -1**C) 0**

D) null

Explanation: The shortest path between two nodes that does not have two children is described as 0.

**5. Why is this heap named leftist heap?**

A) only left subtrees exist**B) the tree is biased to get deep down the left**

C) it is balanced

D) right trees are unbalanced

Explanation: Since it has a lot of deep left roads, the heap is called a leftist heap. As a result, the correct path should be short.

**6. In a leftist heap, all the operations should be performed on?**

A) left path

B) centre path**C) right path**

D) root

Explanation: Since right paths are short, all operations are carried out on them. Insertions and merges, on the other hand, are not possible on the right direction.

**7. What would be the result if the left subtree of the root has a null path length of 1 and the right subtree has a null path length of 2?**

A) merge occurs without violation

B) violation at left subtree

C) violation at right subtree**D) violation at the root**

Explanation: If the left subtree of the root has a null path length of 1 and the right subtree has a null path length of 2, the leftist property is violated at the root when two leftist heaps are combined.

**8. What happens if the null path length is not updated?**

A) error occurs**B) all null path lengths will be 0**

C) all null path lengths will be -1

D) all null path lengths will be 1

Explanation: If the null path length is not changed during insertion via merge operation in a leftist heap, all null path lengths will be 0.

**9. What is the time taken to delete a minimum element in a leftist heap?**

A) O(N)

B) O(N log N)**C) O(log N)**

D) O(M log N)

Explanation: The time it takes to delete the smallest variable in a leftist heap is calculated to be O. (log N).

**10. In what time can a leftist heap be built?****A) O(N)**

B) O(N log N)

C) O(log N)

D) O(M log N)

Explanation: A leftist heap can be developed in O(N) time by constructing a binary heap, according to the mathematical calculation.

**11. Pointer manipulation is generally more time-consuming than multiplication and division.****A) true**

B) false

Explanation: The use of pointers for combining slows down other operations. This is the most serious flaw in any advanced data structure.

**12. How many properties does a leftist heap support?**

A) 1

B) 2**C) 3**

D) 4

Explanation: A structural property, an ordering property, and a heap order property are all supported by a leftist heap.

**13. In a leftist heap, the null path length of a null node is defined as?**

A) 0

B) 1

C) null**D) -1**

Explanation: The null path length of a null node with no children in a leftist heap tree is -1.

**14. How many nodes does a leftist tree with r nodes must have?**

A) 2^{r}**B) 2 ^{r}-1**

C) 2r

D) 2r-1

Explanation: It is proven that a leftist tree with r nodes on the right path has at least 2r-1 nodes. Induction is used to prove this theorem.

**15. Which of the following operations does not destroy the leftist heap property?**

A) insert

B) merge**C) delete**D) swap

Explanation: The leftist heap property can be destroyed if insert and merge operations are performed on the right direction. It’s really simple to restore the house.

A priority queue implemented with a version of a binary heap is known as a leftist tree or leftist heap. The s-value of each node x is the distance to the nearest leaf in the subtree rooted at x. A leftist tree, unlike a binary heap, tries to be very unbalanced. In addition to the heap property, leftist trees are maintained with the lowest s-value in the right descendant of each node. Clark Allan Crane produced the height-biased leftist tree. The left subtree is normally taller than the right subtree, hence the term. A mergeable heap is a leftist tree. A new one-node tree is generated and merged into the existing tree when a new node is inserted into a tree.