KwickClips Java · 43 sec · free
Which traversal prints the root last?
Short answer. Post order: left, right, then root.
For root 50, left 30, right 70, what is in order?
30 50 70.
Root 50, left 30, right 70
| Order | Rule | Output |
|---|---|---|
| Pre | Root L R | 50 30 70 |
| In | L Root R | 30 50 70 |
| Post | L R Root | 30 70 50 |
Remember
| Pre: root first |
| In: root middle |
| Post: root last |
Three traversals. One trick to remember. Watch the root. Pre order prints the root first. In order puts it in the middle. Post order prints it last. Remember. Pre means root first. In means root in the middle. Post means root last.
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
In a binary search tree, which side holds smaller values?41 sec
Which nodes are the leaves here?43 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy