Insertion in Binary Search Tree

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/tree/bst-basics-operations/asset-insertion-in-binary-search-tree 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 lecture provides a concise overview of Binary Search Tree (BST) operations, focusing heavily on the insertion mechanism. It opens with a definition slide outlining the three main operations: insertion, deletion, and lookup. The content is a detailed walkthrough of a GATE 2015 problem involving tree construction. The instructor methodically constructs a BST by inserting a specific sequence of integers: 71, 65, 84, 69, 67, and 83. He explains the logic behind each placement clearly. The problem requires identifying the element residing at the lowest level. By visually drawing the tree node by node, the instructor clarifies how the sequence of insertion dictates the final shape and depth of the tree, leading to the correct identification of the deepest node.

Chapters

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

    The video begins with a slide titled "Operations," listing the three primary functions: insertion, deletion, and lookup. The instructor introduces a GATE 2015 problem, asking to determine the element at the lowest level after inserting 71, 65, 84, 69, 67, and 83 into an initially empty BST. He starts the construction process by placing 71 as the root node. Following the BST property, he inserts 65 as the left child of 71 and 84 as the right child. The process continues with 69 being placed as the right child of 65. Subsequently, 67 is inserted as the left child of 69. Finally, 83 is added as the left child of 84. Throughout this process, the instructor draws the tree structure on the screen, visually demonstrating the hierarchical relationships and node placement.

  2. 2:00 – 2:22 02:00-02:22

    In the final segment, the instructor completes the analysis. He examines the levels of the tree to identify the deepest node. The tree has 71 at the root, 65 and 84 at the first level, 69 and 83 at the second level, and 67 at the third level. He points out that 67 is the only element at the lowest level (level 3) of the tree. Consequently, he circles option (B) 67 on the slide, confirming it as the correct answer to the GATE question. The video concludes with the final tree diagram and the selected option clearly displayed for the students.

The lecture transitions from theoretical definitions to practical problem-solving. Defining core operations first establishes the necessary rules. The step-by-step drawing reinforces the abstract concept of tree insertion. The final identification of the lowest level element ties the construction process back to the specific question asked, demonstrating how structural properties are derived from insertion sequences effectively. This approach ensures students grasp the "how" and "why" of BST operations effectively.

Loading lesson…