Tree Traversal Pseudocode PQ

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-data-structures/tree/traversals-construction/asset-tree-traversal-pseudocode-pq-4937 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
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

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

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

Loading lesson…