Question discussion

While inserting the elements 71, 56, 48, 96, 76, 82, 98 in an empty binary search tree in the sequence shown, which element will come in th…

359813Medium DSSSB TGT Computer Science 0 replies 0 views
0

While inserting the elements 71, 56, 48, 96, 76, 82, 98 in an empty binary search tree in the sequence shown, which element will come in the lowest level?

  • A98
  • B82
  • C71
  • D96
Correct answer: B

Explanation

Insert 71 (root), 56, 48 (left), 96, 76 (96's left), 82 (right of 76), 98 (right of 96). The deepest node is 82 (71 → 96 → 76 → 82).

Discussion 0

Nobody has replied yet. Start the discussion!