CBT

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/tree/complete-binary-trees/asset-cbt after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | 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, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive lecture on the concept of Complete Binary Trees within data structures. It begins by formally defining the structure based on node distribution across levels. The instructor emphasizes two critical conditions: all levels except possibly the last must be fully populated, and the last level must be filled from left to right without gaps. Visual aids are used extensively to distinguish valid complete binary trees from invalid ones, highlighting specific structural violations. The second half of the lecture transitions to the mathematical properties of these trees, specifically the array-based indexing scheme. The instructor derives and demonstrates formulas to calculate the parent and children of any given node index, reinforcing the concept with a large, numbered tree diagram. This dual approach ensures students understand both the theoretical structure and the practical calculation methods.

Chapters

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

    The session opens with the definition of a Complete Binary Tree displayed prominently on the slide. The instructor reads and underlines the text: 'The binary tree T is said to be complete binary tree, if all its level except possibly the last, have the maximum number of nodes and if all the nodes at the last level appear as far left as possible.' He uses a digital pen to underline 'except possibly the last' and 'appear as far left as possible' to stress the specific constraints required for the definition. He then analyzes a set of diagrams below the text, pointing out a specific tree labeled 'Not a Complete Binary Tree.' He circles a missing node in the last level to demonstrate a violation of the 'far left' rule, showing that a gap exists before the rightmost nodes are filled. This visual comparison helps clarify the strict ordering required for completeness, contrasting it with the valid examples on the left where nodes are packed tightly.

  2. 2:00 – 4:26 02:00-04:26

    The lecture progresses to the indexing properties of complete binary trees, a key concept for implementation. A large diagram of a complete binary tree with nodes numbered 1 through 31 is shown to illustrate the pattern. The instructor introduces the formulas for navigation: 'Specially the left and right children of the node K are 2*k, 2*k + 1 and the parent of k is the node lower bound(k/2).' He underlines these formulas and writes them out in red ink above the tree. He demonstrates the logic by pointing to node 5, showing its children are 10 and 11, and pointing to node 13, showing its parent is 6. He draws arrows to visually connect the parent-child relationships, reinforcing how the mathematical formulas map directly to the tree structure. He also highlights the integer division aspect of the parent formula.

The lesson effectively bridges the gap between the structural definition of a complete binary tree and its practical implementation using array indexing. By first establishing the strict filling order (left-to-right), the instructor sets the stage for the mathematical formulas that follow. The transition from visual definitions to algebraic relationships provides a complete understanding of how these trees are stored and accessed in computer memory, which is crucial for heap data structures and priority queues. The combination of textual definitions, visual diagrams, and mathematical proofs ensures a robust grasp of the topic.

Loading lesson…