← Back to Data Structures & Algorithms
Trees quiz
Five questions on Trees. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.
Question 1 of 5
A node with no children is a:
Question 2 of 5
The depth of the root is:
Question 3 of 5
A perfect binary tree of height 3 has how many nodes?
Question 4 of 5
The minimum possible height of a binary tree with n nodes is about:
Question 5 of 5
In the zero-based array form of a heap, the parent of index 7 is: