Basic Binary Search Tree

𝔸𝕝𝕘𝕖𝕣

Basic Binary Search Tree

include("basic_binary_tree.jl")
"""
array-based binary search tree
left tree values < root value < right tree values
"""
abstract type AbstractBinarySearchTree_arr <: AbstractBinaryTree_arr end
function Base.findfirst(
    value::T,
    tree::Tree,
    place::Int = tree.root,
) where {T,Tree<:AbstractBinarySearchTree_arr}
    if tree.val[place] == value
        return place
    elseif tree.val[place] > value
        if tree.lch[place] == 0
            return 0
        end
        return findfirst(value, tree, tree.lch[place])
    else
        if tree.rch[place] == 0
            return 0
        end
        return findfirst(value, tree, tree.rch[place])
    end
end

Try this Code

About us

We are a group of programmers helping each other build new things, whether it be writing complex encryption programs, or simple ciphers. Our goal is to work together to document and model beautiful, helpful and interesting algorithms using code. We are an open-source community - anyone can contribute. We check each other's work, communicate and collaborate to solve problems. We strive to be welcoming, respectful, yet make sure that our code follows the latest programming guidelines.