Threaded Binary Tree

Duration: 15 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/data-structures/tree/advanced-k-ary-trees/asset-threaded-binary-tree after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. 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
  16. 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
  17. 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
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces threaded binary trees, a data structure that replaces NULL pointers with special links called threads to enable tree traversal without recursion or an auxiliary stack. The instructor defines the concept, distinguishes between single-threaded and double-threaded variants, and demonstrates how left and right pointers are repurposed to point to inorder predecessors or successors. A worked example uses a binary search tree with nodes 1, 2, 3, 5, and 7 (later expanded to a larger tree with values like 10, 8, 30, 4, 9, etc.) to show how NULL pointers are identified and replaced with thread links. The inorder traversal sequence 5, 8, 29, 4, 10, 9, 30, 41, 16, 52 is written on screen to illustrate predecessor and successor relationships. The instructor highlights specific nodes (e.g., 5, 4, 29, 8) and draws arrows to show how traversal proceeds from a node's right child or its inorder successor. The final segment demonstrates the complete inorder traversal of the threaded tree, showing how threads allow sequential access to all nodes without backtracking or stack operations.

Chapters

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

    The lecture opens with the definition of a Threaded Binary Tree on screen: 'A Threaded Binary Tree is a binary tree in which NULL pointers are replaced with special links (threads) to make traversal easier.' The stated purpose is 'To perform tree traversal without using recursion or stack.' Two types are introduced: Single Threaded Binary Tree (with subtypes Left-Threaded, where the left NULL pointer points to the Inorder Predecessor, and Right-Threaded, described as 'Most Common,' where the right NULL pointer points to the Inorder Successor) and Double Threaded Binary Tree. The instructor begins drawing a node structure with fields labeled 'Left Child Add.', 'Data', and 'Right Child Add.'

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

    The instructor draws a binary tree with nodes 1, 2, 3, 5, and 7, then expands individual nodes to show their internal three-field structure. Node 5 is expanded to display 'NULL, Data, 7000' and node 7 shows 'NULL, 7, null,' illustrating how NULL pointers appear in an unthreaded tree. A table format is used to show the left child address, data, and right child address for each node. The instructor then draws a more complete binary tree structure with colored boxes representing node fields and arrows indicating pointer directions, annotating nodes with inorder predecessor and successor threads to demonstrate the double-threaded variant.

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

    A larger binary tree is displayed with three-field nodes annotated with specific values: the root shows '100 10 300,' its left child shows '400 8 500,' and the right child shows '600 30 700.' Leaf nodes display values like 'NULL 5 NULL' and '800 4 NULL.' At the bottom, an inorder traversal sequence is written: '5 8 29 4 10 9 30 41 16 52.' The instructor circles the leftmost node (value 5) and draws a horizontal line under it to indicate its NULL pointers. The words 'Predecessor' and 'Successor' are written with arrows pointing to the inorder sequence, establishing that threads will link each node to its adjacent nodes in this traversal order.

  4. 10:00 – 14:50 10:00-14:50

    The instructor demonstrates the threading process by circling specific values in nodes and connecting them to their positions in the inorder sequence. The value 4 is circled with its null right child highlighted, and a line connects it to the inorder sequence. The value 29 is circled in both the tree and the traversal list, as are values 8 and 5. Green brackets are drawn under several nodes to indicate value ranges. In the final segment, arrows are drawn between nodes to represent successor pointers: an arrow from node 41 points to its successor 16, and an arrow from node 52 points to NULL. The inorder traversal sequence is updated step-by-step at the bottom, progressing through '5 8 29 4 10 9 30 41 16 52 NULL,' demonstrating how threads enable sequential traversal without recursion or a stack.

The lecture progresses from definition to demonstration. First, the core concept is established: NULL pointers in a binary tree are replaced with threads that point to inorder predecessors or successors, eliminating the need for recursion or a stack during traversal. Second, the two main variants are distinguished: single-threaded trees (left or right) and double-threaded trees, with the node structure shown as having three fields (left pointer, data, right pointer). Third, a concrete example is built incrementally: starting with a small tree (nodes 1-7), the instructor expands to show internal node structure, then moves to a larger tree with specific pointer values (e.g., '100 10 300' at the root). The inorder traversal sequence is written out to make predecessor-successor relationships explicit. Finally, the threading process is demonstrated by highlighting NULL pointers and drawing arrows to show how each node's thread links it to its inorder neighbor. The key pedagogical move is connecting the abstract definition (NULL replaced by thread) to a concrete visual example where students can trace the traversal path using only the threads, confirming that no stack or recursion is needed. The sequence 5-8-29-4-10-9-30-41-16-52 serves as the reference for all predecessor and successor links throughout the demonstration.

Loading lesson…