Prepare for Binary Tree Data Structure Interview with iQwizz | Difficulty Level: Advance | Rating: 4.8

Please login before attempting the quiz

Question 1

You have serialized a binary tree using preorder traversal with null markers. During deserialization, which data structure is MOST suitable for efficiently reconstructing the tree from the serialized string?

Linked List
Stack
Queue
Heap

Question 2

When constructing a Segment Tree for a given array, what information is typically stored in each node of the Segment Tree?

The sum of all elements in the corresponding subarray of the original array.
The minimum value within the corresponding subarray of the original array.
It depends on the specific application and the type of queries the Segment Tree is designed to handle.
A statistical measure (like mean or median) of the corresponding subarray.

Question 3

What is the worst-case time complexity for searching for a specific value in a perfectly balanced BST?

O(n log n)
O(n)
O(log n)
O(1)

Question 4

Consider this Python code aiming to check if a Binary Tree is a Binary Search Tree (BST). Does it function correctly?

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

def is_bst(root):
    if root is None:
        return True
    if root.left and root.left.data > root.data:
        return False
    if root.right and root.right.data < root.data:
        return False
    return is_bst(root.left) and is_bst(root.right)

No, the code fails for trees with duplicate values.
Yes, the code correctly identifies any Binary Tree as a BST or not.

Question 5

What is the time complexity of decoding a message encoded using Huffman coding, assuming you have the constructed Huffman tree?

O(1)
O(n)
O(n log n)
O(log n)

Question 6

Which of these operations is NOT efficiently supported by a standard Fenwick tree?

Updating a range of elements with a given value
Calculating the sum of elements in a given range
Finding the minimum value in a given range
Updating a single element in the array

Question 7

What is the maximum number of nodes in a binary tree of height 'h'?

h + 1
2^h
2h - 1
2^(h+1) - 1

Question 8

When deleting a node with two children in a BST, what is the standard approach to maintain the BST property?

Any of the above options can be used.
Replace the node's value with the largest value from its left subtree and recursively delete the node with the largest value.
Replace the node's value with the smallest value from its right subtree and recursively delete the node with the smallest value.
Remove the node and connect its children directly to its parent.

Question 9

Given this C++ code snippet for a Binary Search Tree (BST), what will the tree look like after the following insertions: 5, 3, 8, 1, 4, 7, 9?

struct Node {
    int data;
    Node *left, *right;
};

Node* insert(Node* node, int data) {
    if (node == NULL) {
        return new Node(data);
    }
    if (data < node->data) {
        node->left = insert(node->left, data);
    } else if (data > node->data) {
        node->right = insert(node->right, data);
    }
    return node;
}

Code has compilation errors
```
    8
   / \
  5   9
 / \
3   7
```
/
1 4

Question 10

Is it possible for a Complete Binary Tree to have two adjacent levels that are both not completely filled?

No, it violates the definition of a Complete Binary Tree.
Yes, as long as the unfilled nodes are on the rightmost side of both levels.
Yes, but only if the tree is right-skewed.
Yes, as long as the tree is left-skewed.

Please login before attempting the quiz

Question 1

Linked List
Stack
Queue
Heap

Question 2

When constructing a Segment Tree for a given array, what information is typically stored in each node of the Segment Tree?

The sum of all elements in the corresponding subarray of the original array.
The minimum value within the corresponding subarray of the original array.
It depends on the specific application and the type of queries the Segment Tree is designed to handle.
A statistical measure (like mean or median) of the corresponding subarray.

Question 3

What is the worst-case time complexity for searching for a specific value in a perfectly balanced BST?

O(n log n)
O(n)
O(log n)
O(1)

Question 4

Consider this Python code aiming to check if a Binary Tree is a Binary Search Tree (BST). Does it function correctly?

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

def is_bst(root):
    if root is None:
        return True
    if root.left and root.left.data > root.data:
        return False
    if root.right and root.right.data < root.data:
        return False
    return is_bst(root.left) and is_bst(root.right)

No, the code fails for trees with duplicate values.
Yes, the code correctly identifies any Binary Tree as a BST or not.

Question 5

What is the time complexity of decoding a message encoded using Huffman coding, assuming you have the constructed Huffman tree?

O(1)
O(n)
O(n log n)
O(log n)

Question 6

Which of these operations is NOT efficiently supported by a standard Fenwick tree?

Updating a range of elements with a given value
Calculating the sum of elements in a given range
Finding the minimum value in a given range
Updating a single element in the array

Question 7

What is the maximum number of nodes in a binary tree of height 'h'?

h + 1
2^h
2h - 1
2^(h+1) - 1

Question 8

When deleting a node with two children in a BST, what is the standard approach to maintain the BST property?

Any of the above options can be used.
Replace the node's value with the largest value from its left subtree and recursively delete the node with the largest value.
Replace the node's value with the smallest value from its right subtree and recursively delete the node with the smallest value.
Remove the node and connect its children directly to its parent.

Question 9

Given this C++ code snippet for a Binary Search Tree (BST), what will the tree look like after the following insertions: 5, 3, 8, 1, 4, 7, 9?

struct Node {
    int data;
    Node *left, *right;
};

Node* insert(Node* node, int data) {
    if (node == NULL) {
        return new Node(data);
    }
    if (data < node->data) {
        node->left = insert(node->left, data);
    } else if (data > node->data) {
        node->right = insert(node->right, data);
    }
    return node;
}

Code has compilation errors
```
    8
   / \
  5   9
 / \
3   7
```
/
1 4

Question 10

Is it possible for a Complete Binary Tree to have two adjacent levels that are both not completely filled?

No, it violates the definition of a Complete Binary Tree.
Yes, as long as the unfilled nodes are on the rightmost side of both levels.
Yes, but only if the tree is right-skewed.
Yes, as long as the tree is left-skewed.

Binary Tree Data Structure Questions

Please login before attempting the quiz

Question 1

Question 2

Question 3

Question 4

Question 5

Question 6

Question 7

Question 8

Question 9

Question 10

Please login before attempting the quiz

Question 1

Question 2

Question 3

Question 4

Question 5

Question 6

Question 7

Question 8

Question 9

Question 10

Login Account