Question 69

Computer Awareness Trees Hard

Consider the following tree. This is a

Question Image
(A) AVL Search Tree
(B) Binary Tree
(C) Binary Search Tree
(D) Fibonacci Tree
✓ Correct Answer: Option B Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

The tree in the figure has root 105, with left child 165 and right child 125.

  • It is not a BST: the left child 165 is greater than the root 105. (So it is not an AVL search tree either.)
  • There is no Fibonacci-tree structure.
  • Each node has at most two children, so it is simply a binary tree.

Answer: (B) Binary Tree

Practice Similar Trees Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2024:

Q19 Consider a completely skewed (left / right) binary search tree with n...
Solve →
Q1 Which one of the following data structures are preferred in database...
Solve →
Q5 \[ |l l| List - I & List - II \\ (A) Asynchronous & (II) The operation is...
Solve →
Q6 Consider a system with 1 K pages and 512 frames and each page is of size 2...
Solve →
Q8 Each node is having a successor node in \( \) :
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →