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.
-
Updated
Dec 24, 2022 - Go
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.
Implementation of all BST traversals and tree cloning
This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.
Binary Tree Traversals and Views.
This is a simple Go program that traverses a tree in different ways. (Pre-order, In-order, Post-order, and Level-order)
Here are two samples of the tree structure and an ability to set traversing type in-depth or in-width
This program represents the form of binary trees in linked lists, it allows in-order, pre-order and post-order traversals, as well as inserting new nodes, searching for keys, deleting nodes, among other functions.
Add a description, image, and links to the tree-traversal-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the tree-traversal-algorithms topic, visit your repo's landing page and select "manage topics."