Why BST Over Plain Binary Tree in DSA Go - Why This Pattern

Mental Model

A Binary Search Tree (BST) keeps data sorted so we can find things fast, unlike a plain binary tree which has no order.

Analogy: Imagine a phone book: names are sorted alphabetically so you can quickly find a number. A plain binary tree is like a random pile of papers with names scattered everywhere.

Plain Binary Tree:
    5
   / \
  3   8
 /     \
7       9
/ 
2 

BST:
    5
   / \
  3   8
 /     \
2       9

Dry Run Walkthrough

Input: Plain binary tree with nodes 5(root),3(left),8(right),7(3.left),2(7.left),9(8.right); BST with nodes 5,3(left),8(right),2(3.left),9(8.right)

Goal: Show how searching for 2 differs in speed and steps between plain binary tree and BST

Step 1: Start search for 2 at root 5 (!=2) in both trees

Plain: [5] ; BST: [5]

Why: Always check the root node first in tree search

Step 2: Plain recurses to left child 3 (!=2); BST goes left (2 < 5) to 3 (!=2)

Plain: 5 -> [3] ; BST: 5 -> [3]

Why: Plain tree checks left subtree first (DFS order); BST uses < to go left

Step 3: Plain recurses to left of 3: 7 (!=2); BST goes left (2 < 3) to 2 (==2, found!)

Plain: 5 -> 3 -> [7] ; BST: 5 -> 3 -> [2] FOUND

Why: Plain has no order, blindly checks 3.left=7 (>2, unnecessary); BST order guides directly left to 2

Step 4: Plain recurses to left of 7: 2 (==2, found!)

Plain: 5 -> 3 -> 7 -> [2] FOUND ; BST: already found after 3 steps

Why: Plain finds 2 but after extra unnecessary visit to 7

Result:

Plain Tree: found 2 after 4 steps/nodes visited (5->3->7->2)
BST: found 2 after 3 steps/nodes visited (5->3->2)
BST skips irrelevant nodes using order property

Annotated Code

DSA Go

package main

import "fmt"

// Node represents a node in a binary tree
type Node struct {
	val   int
	left  *Node
	right *Node
}

// SearchPlain searches for a value in a plain binary tree (no order)
func SearchPlain(root *Node, target int) bool {
	if root == nil {
		return false
	}
	if root.val == target {
		return true
	}
	// Search left subtree
	if SearchPlain(root.left, target) {
		return true
	}
	// Search right subtree
	return SearchPlain(root.right, target)
}

// SearchBST searches for a value in a BST using order
func SearchBST(root *Node, target int) bool {
	if root == nil {
		return false
	}
	if root.val == target {
		return true
	}
	if target < root.val {
		return SearchBST(root.left, target) // go left if smaller
	} else {
		return SearchBST(root.right, target) // go right if bigger or equal
	}
}

func main() {
	// Plain binary tree
	plain := &Node{5, nil, nil}
	plain.left = &Node{3, nil, nil}
	plain.right = &Node{8, nil, nil}
	plain.left.left = &Node{7, nil, nil}
	plain.left.left.left = &Node{2, nil, nil}
	plain.right.right = &Node{9, nil, nil}

	// BST
	bst := &Node{5, nil, nil}
	bst.left = &Node{3, nil, nil}
	bst.right = &Node{8, nil, nil}
	bst.left.left = &Node{2, nil, nil}
	bst.right.right = &Node{9, nil, nil}

	fmt.Println("Search 2 in plain binary tree:", SearchPlain(plain, 2))
	fmt.Println("Search 2 in BST:", SearchBST(bst, 2))
}

if root == nil { return false }

stop search if reached empty node

if root.val == target { return true }

found target value

if SearchPlain(root.left, target) { return true } ; return SearchPlain(root.right, target)

search left then right subtrees in plain tree (no order, checks both if needed)

if target < root.val { return SearchBST(root.left, target) } else { return SearchBST(root.right, target) }

use BST order to decide which subtree to search (skips half)

Output

Search 2 in plain binary tree: true

Search 2 in BST: true

Complexity Analysis

Time: O(n) for plain binary tree because we may check every node without order

Space: O(h) where h is tree height due to recursion stack in both trees

vs Alternative: BST search is faster on average O(log n) because it skips half the tree each step, unlike plain tree which checks all nodes

Edge Cases

Empty tree

Search returns false immediately

DSA Go

if root == nil { return false }

Target not in tree

Search explores all nodes in plain tree, or follows BST path until leaf

DSA Go

if root == nil { return false }

Single node tree with target

Search finds target immediately

DSA Go

if root.val == target { return true }

When to Use This Pattern

When you need fast search in a tree and data is sorted, reach for BST because it uses order to skip half the nodes each step.

Common Mistakes

Mistake: Trying to search a BST like a plain tree by checking both children always
Fix: Use the BST property to decide only one subtree to search based on comparison

Summary

A BST keeps nodes in order to speed up search compared to a plain binary tree.

Use a BST when you want faster search, insert, or delete operations on sorted data.

The key insight is that BST order lets you ignore half the tree at each step, making search faster.

Practice

1. Why is a Binary Search Tree (BST) preferred over a plain Binary Tree for searching elements?

easy

A. Because BST uses less memory than a plain Binary Tree

B. Because BST keeps elements in a sorted order allowing faster search

C. Because BST nodes can have more than two children

D. Because BST does not require pointers to child nodes

Solution

1. Step 1: Understand the structure difference

   A plain Binary Tree has no order among nodes, while BST keeps nodes sorted so left child is smaller and right child is larger.

2. Step 2: Analyze search efficiency

   Because BST is sorted, searching can skip half the tree at each step, making search faster than in a plain Binary Tree.

3. Final Answer:

   Because BST keeps elements in a sorted order allowing faster search -> Option B

4. Quick Check:

   Sorted structure = faster search [OK]

Hint: BST is sorted, so search is faster than plain tree [OK]

Common Mistakes:

• Thinking BST uses less memory
• Confusing number of children per node
• Believing BST does not use pointers

2. Which of the following is the correct way to declare a node struct for a BST in Go?

easy

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

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

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

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

Solution

1. Step 1: Understand pointer usage in Go structs

   BST nodes must point to child nodes, so left and right should be pointers to Node type.

2. Step 2: Check each option

   type Node struct { value int; left *Node; right *Node } uses *Node pointers correctly. 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{} which is too generic and not typical for BST.

3. Final Answer:

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

4. Quick Check:

   Pointers to Node = correct struct [OK]

Hint: BST nodes use pointers to child nodes in Go [OK]

Common Mistakes:

• Using non-pointer fields causing infinite struct size
• Using wrong pointer types like *int
• Using interface{} instead of concrete types

3. What will be the output of the following Go code that inserts values into a BST and prints inorder traversal?

package main
import "fmt"
type Node struct {
  value int
  left, right *Node
}
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 inorder(root *Node) {
  if root != nil {
    inorder(root.left)
    fmt.Print(root.value, " ")
    inorder(root.right)
  }
}
func main() {
  var root *Node
  values := []int{7, 3, 9, 1, 5}
  for _, v := range values {
    root = insert(root, v)
  }
  inorder(root)
}

medium

A. 1 3 5 7 9

B. 7 3 9 1 5

C. 9 7 5 3 1

D. 3 1 5 7 9

Solution

1. Step 1: Insert values into BST

   Insert 7 as root, then 3 to left, 9 to right, 1 to left of 3, 5 to right of 3.

2. Step 2: Perform inorder traversal

   Inorder visits left subtree, root, then right subtree. So nodes print in sorted order: 1 3 5 7 9.

3. Final Answer:

   1 3 5 7 9 -> Option A

4. Quick Check:

   Inorder traversal = sorted values [OK]

Hint: Inorder traversal of BST prints sorted values [OK]

Common Mistakes:

• Confusing preorder or postorder with inorder
• Misplacing nodes during insertion
• Printing values without spaces

4. The following Go code tries to insert values into a BST but causes a runtime error. What is the error?

package main
import "fmt"
type Node struct {
  value int
  left, right *Node
}
func insert(root *Node, val int) {
  if root == nil {
    root = &Node{value: val}
    return
  }
  if val < root.value {
    insert(root.left, val)
  } else {
    insert(root.right, val)
  }
}
func main() {
  var root *Node
  insert(root, 10)
  insert(root, 5)
  insert(root, 15)
  fmt.Println(root)
}

medium

A. Panic due to nil pointer dereference

B. Stack overflow due to infinite recursion

C. Compilation error due to missing return type

D. root remains nil because insert does not update root pointer

Solution

1. Step 1: Analyze insert function parameter

   insert takes root as value, not pointer to pointer, so changes to root inside insert do not affect caller.

2. Step 2: Understand effect on root variable

   root in main remains nil because insert does not update it outside its scope, so tree is never built.

3. Final Answer:

   root remains nil because insert does not update root pointer -> Option D

4. Quick Check:

   Pointer not updated = root nil [OK]

Hint: Pass pointer to pointer to update root in insert [OK]

Common Mistakes:

• Assuming root updates inside insert affect main
• Ignoring pointer semantics in Go
• Confusing runtime error with logical error

5. You want to store a large set of numbers and perform frequent searches. Why would using a BST be better than a plain Binary Tree, and what is the worst-case time complexity of search in a BST?

hard

A. Plain Binary Tree has better search time than BST

B. BST always guarantees O(1) search time due to sorting

C. BST allows faster average search (O(log n)) but worst-case can be O(n) if unbalanced

D. BST uses less memory and has O(n^2) search time in worst case

Solution

1. Step 1: Compare search efficiency

   BST keeps elements sorted, so average search is O(log n), faster than plain Binary Tree which has no order.

2. Step 2: Consider worst-case scenario

   If BST becomes unbalanced (like a linked list), search degrades to O(n) time.

3. Final Answer:

   BST allows faster average search (O(log n)) but worst-case can be O(n) if unbalanced -> Option C

4. Quick Check:

   Average O(log n), worst O(n) in BST [OK]

Hint: BST average search O(log n), worst O(n) if unbalanced [OK]

Common Mistakes:

• Thinking BST always has O(1) search
• Confusing plain Binary Tree search time
• Ignoring unbalanced BST worst case