Test: Trees - 2 - Software Development MCQ

Preorder traversal is used to create a copy of a binary tree.

In a binary search tree (BST), the minimum element is always present at the leftmost node.

AVL trees are a type of balanced binary search tree that ensures the height of the tree remains logarithmic.

Disjoint-set union (DSU) supports efficient merging of two sets and is used to represent trees with disjoint elements.

After performing the Fenwick Tree construction, the value of the Fenwick Tree array at index 3 will be 10.

Sqrt decomposition is a technique used to partition an array into blocks to perform efficient range queries.

Linked list is not a type of tree data structure. It is a linear data structure.

In a binary tree, a node can have at most two children.

Inorder traversal visits the nodes of a binary tree in the order: left subtree, root, right subtree.

In a binary search tree (BST), the left subtree of a node contains only smaller values, and the right subtree contains only larger values.

Binary heaps are typically used to efficiently find the minimum element, but finding the maximum element requires additional operations.

B-Tree is not a self-balancing binary search tree. It is a balanced tree used for efficient disk access.

In a binary tree, the maximum number of edges is 2n, where n is the number of nodes.

Tries are primarily used for efficient searching and retrieval, not for sorting.

Binary search trees (BSTs) are not commonly used for implementing a stack or queue. Linked lists or arrays are more suitable for stack/queue implementations.