SearchāŒ˜ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in Go

Binary Tree Operations

Understand how to perform essential binary tree operations including searching, insertion, and deletion. Learn traversal methods like depth-first and level-order search, and implement these strategies in Go to manage hierarchical data effectively.

We'll cover the following...

Binary trees store data in a hierarchical structure. Unlike binary search trees (BSTs), they do not follow any ordering rules, so we cannot directly determine where to go when searching or inserting.

Because of this, most operations rely on traversing the tree.

In this lesson, we study three fundamental operations:

  • Searching

  • Insertion

  • Deletion

Searching in a binary tree

Searching in a binary tree means checking whether a given value exists in the tree. Since there is no ordering property, we cannot skip parts of the tree. In the worst case, we may need to visit every node.

A common approach is to use depth-first search (DFS). We start at the root, check its value, and if it does not match, we recursively search the left subtree and then the right subtree.

How this algorithm works

  1. Start at the root node.

  2. If the current node is nil, return false because the value is not found.

  3. Check if the current nodeā€™s value matches the target:

    1. If yes, return true

  4. If not, recursively search the left subtree.

  5. If the value is not found in the left subtree, search the right subtree.

  6. Return true if the value is found in either subtree, otherwise return false.

Go implementation

Below is the Go ...

Go (1.24.2)
func search(root *TreeNode, target string) bool {
    // Base case: if the current node is nil, the value is not found
    if root == nil {
        return false
    }
    // Check if the current node's value matches the target
    if root.Data == target {
        return true
    }
    // Recursively search in the left subtree OR right subtree
    // If found in either, return true
    return search(root.Left, target) || search(root.Right, target)
}
Search in a binary tree

Time complexity: ...