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
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
- 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
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): 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), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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.

