KwickClips Java · 43 sec · free
Which nodes are the leaves here?
Short answer. 20 and 70.
What is the degree of node 30?
1, because it has one child.
Quick quiz
| Question | Answer |
|---|---|
| Leaves? | 20, 70 |
| Degree of 30? | 1 |
| Height? | 2 |
Remember
| Draw the tree first |
| State your convention |
Root fifty has children thirty and seventy. Thirty has twenty. Pause and answer. Leaves: twenty and seventy. Thirty has one child, degree one. Height is two edges. Remember. Draw the tree first. Say if height counts edges or nodes.
This clip is from the full lesson: Binary Trees and Tree Traversals — 8 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: ISC Class 12 Computer Science (868), ISC Class 12 Computer Science (868), Programming All levels Java
More KwickClips from this lesson
What is the degree of a node?43 sec
Which traversal prints the root last?43 sec
In a binary search tree, which side holds smaller values?41 secVoice-over is AI-generated; the script is written and checked by Kajal Ma'am. Confirm anything you plan around against your official board document. We never ask for a password or an OTP.