Important Tree Terminology
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video delivers a comprehensive lecture on the fundamental terminology and properties of tree data structures. It begins by establishing the "Root" as the singular origin point of any tree. The instructor then transitions to "Edges," explaining the mathematical relationship between nodes and links. The core of the lesson covers hierarchical relationships like "Parent" and "Child," distinguishing between "Leaf" and "Internal" nodes. Finally, the lecture defines structural metrics such as "Degree" and "Level," explains "Paths," and concludes with the definition and memory representation of a "Binary tree." This structured approach ensures students grasp the basic building blocks before moving to specific tree types. The instructor uses clear diagrams and handwritten notes to reinforce these concepts.
Chapters
0:00 – 2:00 00:00-02:00
The session opens with the definition of the "Root" node. The slide text explicitly states, "The first/Top most node is called as Root Node. We always have exactly one root node in every tree." The instructor uses a diagram where node 'A' is circled in blue to visually identify it as the root. He underlines the phrase "exactly one root node in every tree" to stress its uniqueness. He explains that the root node is the origin of the tree data structure, from which all other nodes branch out. The visual aid clearly shows 'A' at the top with lines connecting downwards to other nodes like 'B' and 'C'. He emphasizes that the root is the starting point for all traversals.
2:00 – 5:00 02:00-05:00
The topic shifts to "Edge," defined on the slide as "the connecting link between any two nodes." A crucial formula is presented: "In a tree with 'N' number of nodes there will be exactly of 'N-1' number of edges." To prove this, the instructor writes handwritten notes on the screen: "|V| = 11" for vertices (nodes) and "|E| = 10" for edges. He physically draws red lines through the connections in the diagram to count them, verifying that there are indeed 10 edges for 11 nodes. He emphasizes that an edge is simply a link between two nodes, and the N-1 rule is a fundamental property of trees. He counts the edges one by one to verify the total.
5:00 – 7:24 05:00-07:24
The lecture defines hierarchical relationships. "Parent" nodes are predecessors, with the slide stating "Here A, B, C, E & G are Parent nodes". Conversely, "Child" nodes are descendants, such as "B & C are Children of A". "Leaf" or "External" nodes are identified as those with no children, listed as "D, I, J, F, K & H are Leaf nodes". This contrasts with "Internal Nodes" which have at least one child, listed as "A, B, C, E & G are Internal nodes". The "Degree" of a node is the total number of children it has; the slide notes "Degree of B is 3", "Degree of A is 2", and "Degree of F is 0". The "Degree of Tree" is the highest degree allowed. "Level" counting starts at 0 for the root, with children at Level 1. A "Path" is a sequence of nodes and edges, with the example "Path between A & J is A - B - E - J" having length 4. The video concludes with "Binary tree" definition, noting nodes have max two children, and shows a C-struct code snippet for linked representation: `struct node { int data; struct node* left; struct node* right; }`.
The video provides a structured vocabulary for tree data structures, progressing logically from the single root node to the connections (edges) and then to the complex relationships between nodes (parent/child). It solidifies understanding through visual counting of edges and clear definitions of structural properties like degree and level, culminating in the specific case of binary trees and their implementation. This progression from simple definitions to complex structures prepares students for advanced algorithms. By the end, students have a complete glossary of tree terms.

