Initial commit

Author: eliascarv

.JuliaFormatter.toml

@@ -1 +1,10 @@
-# See https://domluna.github.io/JuliaFormatter.jl/stable/ for a list of options
+indent = 2
+margin = 90
+always_for_in = true
+always_use_return = false
+whitespace_typedefs = false
+whitespace_in_kwargs = false
+whitespace_ops_in_indices = true
+remove_extra_newlines = true
+trailing_comma = false
+normalize_line_endings = "unix"

.github/workflows/CI.yml

@@ -23,9 +23,8 @@ jobs:
       fail-fast: false
       matrix:
         version:
-          - '1.10'
-          - '1.11'
-          - 'pre'
+          - 'lts'
+          - '1'
         os:
           - ubuntu-latest
         arch:

.gitignore

@@ -1,4 +1,9 @@
 *.jl.*.cov
 *.jl.cov
 *.jl.mem
-/Manifest.toml
+Manifest.toml
+.vscode
+*.code-workspace
+docs/build
+/.benchmarkci
+/benchmark/*.json

Project.toml

@@ -3,5 +3,9 @@ uuid = "289e92be-c05a-437b-9e67-5b0c799891f8"
 authors = ["Elias Carvalho <[email protected]> and contributors"]
 version = "0.1.0"
 
+[deps]
+AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"
+
 [compat]
+AbstractTrees = "0.4"
 julia = "1.10"

README.md

@@ -1,4 +1,4 @@
-# TreeDataStructures
+# TreeDataStructures.jl
 
 [![Build Status](https://github.com/eliascarv/TreeDataStructures.jl/actions/workflows/CI.yml/badge.svg?branch=main)](https://github.com/eliascarv/TreeDataStructures.jl/actions/workflows/CI.yml?query=branch%3Amain)
 [![Coverage](https://codecov.io/gh/eliascarv/TreeDataStructures.jl/branch/main/graph/badge.svg)](https://codecov.io/gh/eliascarv/TreeDataStructures.jl)

src/TreeDataStructures.jl

@@ -1,5 +1,9 @@
 module TreeDataStructures
 
-# Write your package code here.
+import AbstractTrees
+
+include("avl.jl")
+
+export AVLTree
 
 end

src/avl.jl

@@ -0,0 +1,135 @@
+# ---------
+# AVL NODE
+# ---------
+
+mutable struct AVLNode{K,V}
+  key::K
+  value::V
+  left::Union{AVLNode{K,V},Nothing}
+  right::Union{AVLNode{K,V},Nothing}
+  height::Int
+end
+
+AVLNode(key, value) = AVLNode(key, value, nothing, nothing, 1)
+
+Base.convert(::Type{AVLNode{K,V}}, node::AVLNode) where {K,V} =
+  AVLNode{K,V}(node.key, node.value, node.left, node.right, node.height)
+
+function AbstractTrees.children(node::AVLNode)
+  if !isnothing(node.left) && !isnothing(node.right)
+    (node.left, node.right)
+  elseif !isnothing(node.left)
+    (node.left,)
+  elseif !isnothing(node.right)
+    (node.right,)
+  else
+    ()
+  end
+end
+
+AbstractTrees.nodevalue(node::AVLNode) = node.value
+
+# ---------
+# AVL TREE
+# ---------
+
+mutable struct AVLTree{K,V}
+  root::Union{AVLNode{K,V},Nothing}
+end
+
+AVLTree{K,V}() where {K,V} = AVLTree{K,V}(nothing)
+AVLTree() = AVLTree{Any,Any}()
+
+function Base.getindex(tree::AVLTree{K}, key::K) where {K}
+  node = _search(tree, key)
+  isnothing(node) && throw(KeyError(key))
+  node.value
+end
+
+function Base.setindex!(tree::AVLTree, value, key)
+  tree.root = _insert!(tree.root, key, value)
+  tree
+end
+
+function Base.show(io::IO, ::MIME"text/plain", tree::AVLTree)
+  if isnothing(tree.root)
+    print(io, "AVLTree()")
+  else
+    println(io, "AVLTree")
+    str = AbstractTrees.repr_tree(tree.root, context=io)
+    print(io, str[begin:(end - 1)]) # remove \n at end
+  end
+end
+
+# -----------------
+# HELPER FUNCTIONS
+# -----------------
+
+function _search(tree, key)
+  node = tree.root
+  while !isnothing(node) && key ≠ node.key
+    node = key < node.key ? node.left : node.right
+  end
+  node
+end
+
+function _insert!(root, key, value)
+  if isnothing(root)
+    return AVLNode(key, value)
+  elseif key < root.key
+    root.left = _insert!(root.left, key, value)
+  else
+    root.right = _insert!(root.right, key, value)
+  end
+
+  root.height = 1 + max(_height(root.left), _height(root.right))
+
+  bf = _balancefactor(root)
+
+  if bf > 1 && key < root.left.key
+    _rightrotate!(root)
+  elseif bf < -1 && key > root.right.key
+    _leftrotate!(root)
+  elseif bf > 1 && key > root.left.key
+    _rightrotate!(root)
+  elseif bf < -1 && key < root.right.key
+    _leftrotate!(root)
+  else
+    root
+  end
+end
+
+_height(::Nothing) = 0
+_height(node::AVLNode) = node.height
+
+_balancefactor(::Nothing) = 0
+_balancefactor(node::AVLNode) = _height(node.left) - _height(node.right)
+
+_minnode(::Nothing) = nothing
+_minnode(node::AVLNode) = isnothing(node.left) ? node : _minnode(node.left)
+
+function _leftrotate!(node)
+  B = node.right
+  Y = B.left
+
+  B.left = node
+  node.right = Y
+
+  node.height = 1 + max(_height(node.left), _height(node.right))
+  B.height = 1 + max(_height(B.left), _height(B.right))
+
+  B
+end
+
+function _rightrotate!(node)
+  A = node.left
+  Y = A.right
+
+  A.right = node
+  node.left = Y
+
+  node.height = 1 + max(_height(node.left), _height(node.right))
+  A.height = 1 + max(_height(A.left), _height(A.right))
+
+  A
+end