Post Order Traversal Of Binary Tree
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture focuses on Post-order traversal for binary trees, defined by the sequence Left, Right, Root (L R Root). The instructor presents a slide detailing steps: check if null, recursively traverse left, recursively traverse right, display root data. A sample tree diagram is on the right with nodes A-I and root F. The slide lists the sequence: 'Post-order: A, C, E, D, B, H, I, G, F.' The instructor guides the viewer through the recursive process, tracing from root F to leaf A, then through subtrees. He emphasizes recursive function calls, explaining how traversal moves deep into left branches before processing the root.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the algorithm using a slide titled 'Post-order (L R Root)'. He explains four key steps: checking for null nodes, recursively calling the function for the left subtree, recursively calling it for the right subtree, and displaying root data. Visually, red arrows appear on the tree diagram to illustrate the path, starting from root F, moving left to B, then to A, and continuing through left subtree nodes C and E. The instructor verbally confirms the sequence as he traces the path, ensuring students understand the root is processed only after both subtrees are visited. The slide text 'Post-order: A, C, E, D, B, H, I, G, F' serves as the ground truth for the example.
2:00 – 2:13 02:00-02:13
In the final segment, the instructor writes the final sequence on the screen: 'A C E D B H I G F'. He underlines this sequence to emphasize the result. Additionally, he writes 'Post(F)' and breaks it down into 'Post(B) Post(G) F' to visually represent the recursive structure. This written breakdown reinforces the concept that root node F is processed last, after the left subtree (rooted at B) and right subtree (rooted at G) have been fully traversed. The instructor concludes by confirming this matches the expected output shown at the top of the slide.
The lesson demonstrates Post-order traversal by combining theoretical steps with a practical example. The instructor uses a visual tree diagram and step-by-step tracing to clarify recursive logic, ensuring students grasp why the root is visited last. The final written sequence and the breakdown of 'Post(F)' solidify the understanding of the L-R-Root pattern.

