Packages
random_access_list
0.1.0
A random access list is a list data structure that has O(log n) time lookups and updates, while maintaining a constant time for cons, tail and head operations.
Current section
Files
Jump to
Current section
Files
lib/complete_binary_tree/node.ex
defmodule CompleteBinaryTree.Node do
defstruct [:left, :right, :size, :value]
def new(value, left, right, size) do
struct(__MODULE__, value: value, left: left, right: right, size: size)
end
end