Why BST Property and Why It Matters in DSA Go?

The Big Idea

What if you could find any piece of data as fast as flipping to the right page in a book?

The Scenario

Imagine you have a messy pile of books with no order. When you want a specific book, you have to look through every single one until you find it.

The Problem

Searching through an unordered pile takes a long time and is tiring. You can easily lose track or miss the book you want. It is slow and frustrating.

The Solution

The Binary Search Tree (BST) property keeps books (data) organized so that smaller ones go to the left and bigger ones go to the right. This order helps you find any book quickly without checking all of them.

Before vs After

✗ Before

func findValue(values []int, target int) bool {
    for _, value := range values {
        if value == target {
            return true
        }
    }
    return false
}

✓ After

func findValueBST(node *Node, target int) bool {
    if node == nil {
        return false
    }
    if target == node.Value {
        return true
    } else if target < node.Value {
        return findValueBST(node.Left, target)
    } else {
        return findValueBST(node.Right, target)
    }
}

What It Enables

It enables lightning-fast searching, inserting, and deleting of data by always knowing where to look next.

Real Life Example

Think of a phone book sorted by names. You don't flip every page; you jump to the right section because the names are in order. BST works the same way for data.

Key Takeaways

Without order, searching is slow and tiring.

BST property keeps data sorted for quick access.

This property makes many operations efficient and easy.

Practice

1. What is the main property that defines a Binary Search Tree (BST)?

easy

A. Nodes are arranged in a complete binary tree shape

B. Left child nodes have smaller values, right child nodes have larger values

C. All nodes have exactly two children

D. Nodes store only unique values without any order

Solution

1. Step 1: Understand BST node arrangement

   In a BST, each node's left child contains values smaller than the node, and the right child contains values larger than the node.

2. Step 2: Compare with other tree types

   Other options describe different tree properties, but only Left child nodes have smaller values, right child nodes have larger values matches the BST property.

3. Final Answer:

   Left child nodes have smaller values, right child nodes have larger values -> Option B

4. Quick Check:

   BST property = Left smaller, right larger [OK]

Hint: Remember BST orders left < node < right [OK]

Common Mistakes:

• Confusing BST with complete binary tree
• Thinking all nodes must have two children
• Ignoring the order property of BST

2. Which of the following Go struct definitions correctly represents a node in a BST?

easy

A. type Node struct { value int; left Node; right Node }

B. type Node struct { value int; left *int; right *int }

C. type Node struct { value int; left *Node; right *Node }

D. type Node struct { value int; left interface{}; right interface{} }

Solution

1. Step 1: Check pointer usage for child nodes

   In Go, child nodes must be pointers to allow nil and recursive structure. type Node struct { value int; left *Node; right *Node } uses *Node pointers correctly.

2. Step 2: Identify incorrect struct fields

   type Node struct { value int; left Node; right Node } uses Node directly, causing infinite size. type Node struct { value int; left *int; right *int } uses *int which is wrong type. type Node struct { value int; left interface{}; right interface{} } uses interface{}, losing type safety.

3. Final Answer:

   type Node struct { value int; left *Node; right *Node } -> Option C

4. Quick Check:

   Use pointers for recursive structs in Go [OK]

Hint: Use *Node for left and right child pointers [OK]

Common Mistakes:

• Using struct fields instead of pointers for children
• Using wrong pointer types like *int
• Using interface{} losing type safety

3. What will be the in-order traversal output of this BST after inserting values in order: 10, 5, 15, 3, 7?

package main
import "fmt"
type Node struct {
  value int
  left, right *Node
}
func inOrder(root *Node) {
  if root == nil {
    return
  }
  inOrder(root.left)
  fmt.Print(root.value, " ")
  inOrder(root.right)
}
func insert(root *Node, val int) *Node {
  if root == nil {
    return &Node{value: val}
  }
  if val < root.value {
    root.left = insert(root.left, val)
  } else {
    root.right = insert(root.right, val)
  }
  return root
}
func main() {
  var root *Node
  vals := []int{10, 5, 15, 3, 7}
  for _, v := range vals {
    root = insert(root, v)
  }
  inOrder(root)
}

medium

A. 3 5 7 10 15

B. 10 5 15 3 7

C. 15 10 7 5 3

D. 5 3 7 10 15

Solution

1. Step 1: Insert values maintaining BST property

   Insert 10 as root, 5 to left, 15 to right, 3 left of 5, 7 right of 5.

2. Step 2: Perform in-order traversal

   In-order visits left subtree, node, right subtree. So output is 3 5 7 10 15.

3. Final Answer:

   3 5 7 10 15 -> Option A

4. Quick Check:

   In-order traversal of BST = sorted values [OK]

Hint: In-order traversal of BST gives sorted values [OK]

Common Mistakes:

• Confusing pre-order or post-order with in-order
• Not inserting nodes correctly in BST
• Printing values in insertion order

4. The following Go code tries to insert a value into a BST but fails to correctly insert the value. What is the bug?

func insert(root *Node, val int) *Node {
  if root == nil {
    return &Node{value: val}
  }
  if val <= root.value {
    insert(root.left, val)
  } else {
    insert(root.right, val)
  }
  return root
}

medium

A. Missing assignment to root.left or root.right after recursive insert

B. Using <= instead of < causes infinite recursion

C. Returning root instead of new node causes error

D. Function should not return *Node

Solution

1. Step 1: Analyze recursive insert calls

   The recursive calls insert(root.left, val) and insert(root.right, val) do not assign the returned node back to root.left or root.right.

2. Step 2: Understand why assignment is needed

   Without assignment, new nodes are not linked to the tree, causing incorrect structure.

3. Final Answer:

   Missing assignment to root.left or root.right after recursive insert -> Option A

4. Quick Check:

   Assign recursive insert result to child pointers [OK]

Hint: Always assign recursive insert result to child pointers [OK]

Common Mistakes:

• Forgetting to assign recursive call results
• Confusing comparison operators causing infinite loops
• Ignoring return values in recursive functions

5. You want to check if a binary tree is a valid BST. Which approach correctly verifies the BST property for all nodes?

hard

A. Check only immediate children values against node

B. Check in-order traversal for duplicates only

C. Check tree balance and uniqueness of values

D. Recursively verify all subtree values against node limits

Solution

1. Step 1: Understand BST validation requirements

   BST property requires all nodes in left subtree to be less than current node and all in right subtree to be greater, not just immediate children.

2. Step 2: Evaluate each option

   Recursively verify all subtree values against node limits correctly checks recursively with value limits. Check only immediate children values against node only checks immediate children, which can miss violations deeper in the tree.

3. Final Answer:

   Recursively verify all subtree values against node limits -> Option D

4. Quick Check:

   BST validation = recursive range checks [OK]

Hint: Check all subtree values recursively, not just children [OK]

Common Mistakes:

• Checking only immediate children values
• Confusing balance with BST property
• Assuming no duplicates means valid BST