Tree Traversal Pseudocode (Post-Order )
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture analyzes a C function named `what` that performs a tree traversal. The instructor displays the code and draws a binary tree to trace the function's execution. He explains the recursive calls and the base case, then determines the output sequence. The final result is identified as a Post-Order Traversal, with the output sequence 10 8 9 5 12.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a programming problem displayed at the top: "Find what this function is doing?". The code snippet `void what(struct Bnode *t)` is shown in orange text on the left side. The instructor uses a digital pen to underline the function name `what` and the parameter `t`, emphasizing the recursive nature of the function. He explains the `if (t)` condition, which serves as the base case to prevent null pointer dereferencing. He then begins to draw a binary tree on the whiteboard space to the right. He draws a root node containing the value 12. From this root, he draws a left edge to a node with value 10 and a right edge to a node with value 5. This visual setup is crucial for understanding how the function traverses the data structure. The instructor's gestures guide the viewer's attention to the code and the diagram simultaneously. The background is white with a faint watermark "KnowledgeGate". The instructor is visible in the bottom right corner, wearing a black shirt. The code includes a `printf` statement which is not yet explained. The instructor's focus is on the code structure. The text "Find what this function is doing?" is clearly visible. The instructor's hand movements are deliberate.
2:00 – 5:00 02:00-05:00
Continuing the diagram, the instructor adds the remaining nodes to the binary tree. Node 5 is shown to have a left child with value 8 and a right child with value 9. He starts the execution trace by writing `what(12)` at the top right. He explains that the function first calls itself on the left child, so he writes `what(10)`. He traces further down, noting that node 10 has no children, so he writes `w(NULL)` for both its left and right children. He moves to the right subtree, tracing `what(5)`. He then traces `what(8)` and writes `w(NULL)` for its children. Similarly, he traces `what(9)` and writes `w(NULL)` for its children. This detailed tracing shows the depth-first approach of the recursion. The instructor writes these calls in black ink, contrasting with the orange code. The tree structure is now fully drawn, showing a complete binary tree with 5 nodes. The instructor is methodically tracing the path of execution. The visual representation of the tree is key to understanding the recursion. The instructor's handwriting is legible. The tree nodes are clearly labeled with numbers.
5:00 – 7:37 05:00-07:37
The instructor completes the execution trace by determining the order in which the `printf` statement executes. Since the print statement comes after the recursive calls, it executes when the recursion unwinds. He writes the final output sequence at the bottom: 10 8 9 5 12. He circles the `printf` line in the code to highlight that this is the action performed. He explicitly states that this traversal order, visiting the left subtree, then the right subtree, and finally the root, is known as Post-Order Traversal. He draws a green box around the final output sequence to emphasize the result. The video concludes with a clear explanation of the function's purpose, linking the code structure to the traversal algorithm. The final output is clearly visible in a green box at the bottom left. The instructor points to the code and the output to reinforce the connection. The code lines `what(t -> LC)` and `what(t -> RC)` are clearly visible. The instructor's explanation ties the visual trace to the theoretical concept. The green box is a strong visual cue. The instructor's final summary is clear.
The video provides a step-by-step analysis of a recursive C function that traverses a binary tree. By drawing the tree and tracing the function calls, the instructor demonstrates that the function performs a Post-Order Traversal. The key takeaway is that the root node is processed after its left and right subtrees, resulting in the output sequence 10 8 9 5 12 for the given tree structure.

