🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Binary Trees & BST Quiz: all 8 questions

Binary Trees & BST Quiz · Question 3 of 8

What is the maximum depth (counting nodes) of that tree?

What is the maximum depth (counting nodes) of that tree?

Answer & explanation

Correct answer: 3

The longest root-to-leaf path is 1 → 2 → 4 (or 5): 3 nodes.

Can you get the rest right without peeking?

Take the timed Binary Trees & BST Quiz quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →