Important Tree Terminology
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: 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) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
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.

