ds

This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.

go golang tree data-structure tree-structure tree-search tree-traversal datastructure ds tree-traversal-algorithm tree-traversal-algorithms complete-tree tree-complete

Updated Dec 24, 2022
Go

BaseMax / TreeTraversalsGo

Star

This is a simple Go program that traverses a tree in different ways. (Pre-order, In-order, Post-order, and Level-order)

go golang tree data-structure tree-search tree-traversal datastructure ds tree-traversal-algorithm tree-traversal-algorithms tree-traverse

Updated Dec 19, 2022
Go

BaseMax / General2BinaryTreeGo

Star

This is a simple Go program that converts a general tree to a binary tree.

go golang tree data-structure binary-tree tree-structure tree-search binarytree datastructure ds generaltree general-tree

Updated Dec 17, 2022
Go

BaseMax / BinaryTreeGo

Star

Implementation of a binary tree in Go. A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A node with no children is called a leaf node. A node cannot have more than two children.

go golang tree algorithm data-structure algorithms binary-tree tree-structure tree-search datastructure algorithms-datastructures ds algorithms-and-data-structures tree-algorithms tree-data-structure tree-binary

Updated Dec 16, 2022
Go

BaseMax / SparseMatrixLinkedListGo

Star

Sparse-Matrix Linked-List Go is a sparse matrix implementation in Go using a linked list. This is a data structure that stores only non-zero values in a matrix. This is useful when you have a lot of zeros in your matrix. This data structure is also useful when you want to perform operations on sparse matrices.

go golang data-structure sparse linkedlist sparse-matrix datastructure ds sparsematrix

Updated Dec 14, 2022
Go

BaseMax / GeneralTreeGo

Star

Implentation of a general tree in Go Programming Language. A general tree is a tree data structure in which each node can have an arbitrary number of children. We are storing children in an array.