Tree traversal Pseudocode (Inorder)

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/data-structures/tree/traversals-construction/asset-tree-traversal-pseudocode-inorder after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Domain Test): Introduction to CN, Data Communication, 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, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture explains how to determine the output of a recursive C function named `what` that operates on a binary tree. The instructor analyzes the code structure, specifically the recursive calls to left and right children and the print statement in between. He draws a sample binary tree with nodes A, B, C, D, and E to demonstrate the execution. By tracing the function call stack step-by-step, he shows that the function performs an in-order traversal, printing the nodes in the sequence D, B, E, A, C.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins with a slide displaying the question 'Find what this function is doing?' alongside a C code snippet `void what(struct Bnode *t)`. The instructor underlines `struct Bnode *t` to identify the data structure. He explains the `if (t)` condition which serves as a base case. To illustrate, he draws a binary tree on the right side of the screen, starting with a root node 'A', adding left child 'B' and right child 'C', and then adding children 'D' and 'E' to node 'B'.

  2. 2:00 – 5:00 02:00-05:00

    The instructor begins tracing the function execution using a stack diagram. He draws a stack frame for the root node 'A' at address 1000, labeling fields 'LC', 'Data', and 'RC'. He explains that the first line `what(t -> LC)` triggers a recursive call to the left child 'B' at address 2000. He draws a new stack frame for B and continues the recursion to node 'D' at address 4000, writing `w(1000)`, `w(2000)`, and `w(4000)` to track the call stack depth.

  3. 5:00 – 10:00 05:00-10:00

    The trace reaches the leaf node D. The instructor notes that D's left child is null, so the recursive call returns immediately. The `printf` statement executes, printing 'D'. He writes 'D' on the board. Control returns to B, where `printf` prints 'B'. Then, the function calls `what(t -> RC)` for B, moving to node E at address 5000. He traces E: left child null, print E, right child null. Control returns to A, `printf` prints 'A'. Finally, `what(t -> RC)` for A moves to node C at address 3000, which is traced similarly.

  4. 10:00 – 10:01 10:00-10:01

    The video concludes with the final result. The instructor writes the sequence of printed values 'D B E A C' in a box at the bottom left. He explains that this specific order—Left subtree, Root, Right subtree—defines an in-order traversal. The final output is highlighted to confirm the function's behavior.

The lecture demonstrates a systematic approach to tracing recursive functions on tree data structures. By visualizing the call stack and following the order of operations (Left, Root, Right), the instructor proves that the function performs an in-order traversal. This method is essential for understanding recursion and tree algorithms in computer science.

Loading lesson…