Tree Traversal Pseudocode PQ
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a detailed step-by-step walkthrough of tracing the execution of two mutually recursive functions, A and B, operating on a binary tree data structure. The instructor begins by presenting the C-like pseudocode for both functions and a sample binary tree. He then manually simulates the function calls, drawing a call tree to visualize the recursion depth and order. The primary goal is to determine the sequence of integers printed to the console by the printf statements within the functions. The video serves as a practical example of understanding recursion and function call stacks in computer science, specifically focusing on how two functions can call each other. The instructor uses a whiteboard or digital canvas to draw the tree and the call stack.
Chapters
0:00 – 2:00 00:00-02:00
The video starts with the problem statement: "Find what this function is doing?" The code for Void A(struct Bnode *t) and Void B(struct Bnode *t) is displayed on the screen. Function A is defined to recursively call B on the left child, print the current node's data, and then call B on the right child. Conversely, Function B prints the current node's data, then recursively calls A on the left child, and finally calls A on the right child. The instructor draws a binary tree with root 10, left child 30, right child 30, and a left child of the left 30 which is 40. He initiates the trace by calling A(10) and explains the initial steps of the recursion, setting up the context for the detailed trace. He carefully follows the indentation and logic flow.
2:00 – 5:00 02:00-05:00
The instructor meticulously traces the execution on the right side of the screen, drawing a tree of function calls to keep track of the state. Starting with A(10), it calls B(30) (left child). Inside B(30), it prints 30. Then it calls A(40) (left child of 30). Inside A(40), it calls B(NULL) (left child of 40), which returns immediately because the node is null. Then A(40) prints 40. Then A(40) calls B(NULL) (right child of 40), which returns. A(40) returns. Back in B(30), it calls A(NULL) (right child of 30), which returns. B(30) returns. Back in A(10), it prints 10. Then it calls B(30) (right child of 10). Inside this B(30), it prints 30. Then it calls A(NULL) (left child) and A(NULL) (right child), both returning immediately. The instructor writes the final output sequence in a green box: 30 40 10 30. He underlines the printed values as he goes. He writes the numbers 30, 40, 10, 30 in a box at the bottom.
5:00 – 5:36 05:00-05:36
The instructor concludes the lesson by reviewing the code structure one last time. He highlights the mutual recursion where A calls B and B calls A. He points out the specific lines of code responsible for the printing and the recursive calls, emphasizing the order of operations. He confirms that the output sequence 30 40 10 30 is correct based on the trace. He emphasizes understanding the order of execution in mutually recursive functions and how the call stack unwinds. The video ends with the final answer clearly displayed and the instructor summarizing the key takeaway about the traversal order. The instructor ensures the student understands the base case where the node is null.
The video effectively demonstrates the concept of mutual recursion through a concrete example. By tracing the execution of functions A and B on a binary tree, the instructor clarifies how the call stack operates when functions call each other. The step-by-step visual aid of drawing the call tree helps students understand the order of operations and the final output sequence. This method is crucial for debugging and understanding complex recursive algorithms in computer science.

