Tree Practice Question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/tree/traversals-construction/asset-tree-practice-question-4594 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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
  15. Operating Systems: 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
  16. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video features an educational lecture by Sanchit Jain Sir from Knowledge Gate, focusing on a C programming problem involving binary trees. The specific task is to complete a function named `maxDepth` which calculates the maximum depth or height of a binary tree, noting that the root is at level 1. The code snippet provided on screen defines the function signature `int maxDepth(struct node* node)`. The instructor walks through the logic, starting with the base case: `if (node == NULL) return 0;`. This condition ensures that if a node does not exist, the depth contribution is zero. Following the base case, the `else` block handles the recursive step. The code calculates the depth of the left subtree using `int lDepth = maxDepth(node->left);` and the right subtree using `int rDepth = maxDepth(node->right);`. The critical part of the lecture is analyzing the final return statements. The code presents a conditional check: `if (lDepth > rDepth) return X; else return Y;`. The instructor explains that to find the total height, one must take the larger of the two subtree depths and add 1 to account for the current node itself. Consequently, the placeholders X and Y must represent the depth of the respective subtrees incremented by one. The question text at the bottom asks: "What should be the values of X and Y so that the function works correctly?". The visible options are (A) X = lDepth, Y = rDepth; (B) X = lDepth + 1, Y = rDepth + 1; (C) X = lDepth - 1, Y = rDepth - 1; and (D) None of the above. The instructor emphasizes that since the depth includes the current node, the value returned must be the subtree depth plus one. He points to the code structure to justify why adding 1 is necessary for the correct calculation of tree height, highlighting the recursive definition where height is 1 + max(left_height, right_height). The watermark "KNOWLEDGEGATE" is visible throughout the screen. The instructor is seated in a black gaming chair, wearing a white t-shirt with the Knowledge Gate logo.

Chapters

  1. 0:00 – 1:39 00:00-01:39

    The video analyzes a C function `maxDepth` for binary trees. It covers the base case `if (node==NULL) return 0;`, the recursive calculation of `lDepth` and `rDepth`, and the logic to determine the return values X and Y, which must account for the current node's level by adding 1 to the subtree depths. The instructor explains that the height of a node is 1 plus the maximum height of its children, requiring the addition of 1 in the return statement.

The lecture reinforces the recursive definition of tree height, where the height of a node is 1 plus the maximum height of its children, requiring the addition of 1 in the return statement to correctly calculate the total depth.

Loading lesson…