BST Practice Question

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/data-structures/tree/bst-basics-operations/asset-bst-practice-question-4652 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment addresses a binary search tree (BST) practice question: how many distinct BSTs can be constructed with 3 distinct keys. The instructor presents the multiple-choice options (4, 5, 6, or 9), then works through a concrete example using keys 1, 2, and 3. By systematically enumerating all possible insertion sequences (permutations) and drawing the resulting tree structures, the instructor demonstrates that each permutation yields a unique BST shape. The six distinct trees are numbered and displayed, leading to the answer c) 6. In the final segment, the instructor begins introducing a more general combinatorial approach using a root node K with left and right subtrees, writing partial calculations such as 1*1=1 and 2*1=2, suggesting a recursive counting method for larger N.

Chapters

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

    The slide displays the question 'Q how many distinct BST can be constructed with 3 distinct keys?' in orange text, with answer options a) 4, b) 5, c) 6, d) 9. Red hand-drawn underlines emphasize key terms: 'distinct', 'BST can be constructed', and '3 distinct keys'. The instructor then writes 'Example -> N = 3' and the key set '1,2,3', beginning to draw the first BST structure by placing node 1 as root, then adding node 2 as a right child, and node 3 as a right child of 2, forming a right-leaning chain.

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

    The instructor continues drawing additional BST structures for different insertion sequences. The first tree (1,2,3) is a right-skewed chain tagged with circled '1'. The second tree (1,3,2) shows root 1 with right child 3 and left child 2 beneath it, tagged '2'. A balanced tree for sequence 2,1,3 is drawn with root 2 and children 1 (left) and 3 (right). A right-skewed tree for 3,1,2 and a left-skewed tree for 3,2,1 are also drawn. Numbered labels from 1 to 6 appear below each tree, confirming six distinct configurations and supporting answer option c) 6.

  3. 5:00 – 7:29 05:00-07:29

    The board now shows all six hand-drawn BSTs grouped by root: sequences 1,2,3 and 1,3,2 under root 1; 2,1,3 and 2,3,1 under root 2 with children 1 and 3; and 3,1,2 and 3,2,1 under root 3. A bottom-left diagram introduces a general node 'K' branching to two circles, one labeled 'No of possible combination structures.' The instructor writes partial calculations including a crossed-out '1 * 2', then '1 * 1 = 1' and '2 * 1 = 2', hinting at a recursive formula for counting BSTs by multiplying left and right subtree possibilities. The segment ends before the full general solution is completed.

The core teaching objective is to connect permutation-based enumeration with BST structure uniqueness. The instructor uses N=3 as a tractable example: all 6 permutations of keys {1,2,3} produce distinct tree shapes because BST insertion order determines structure. This concrete demonstration validates the answer c) 6 and builds intuition for why the count equals the number of permutations for small N. The transition to a general method via node K with left/right subtree multiplication suggests the Catalan number recurrence C(n) = sum_{i=0}^{n-1} C(i)*C(n-1-i), though this is only partially developed in the sampled frames. Students should note that for N=3, the six trees correspond exactly to 3! = 6 permutations, but this equivalence does not hold for larger N where different insertion sequences can yield the same shape.

Loading lesson…