Post Order Traversal Of Binary Tree

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/data-structure-algorithms/tree/traversals-construction/asset-post-order-traversal-of-binary-tree after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
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

  1. 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. 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.

Loading lesson…