Source Code for HappyCoders.eu article series on tree data structures (binary tree, binary search tree, AVL tree, red-black tree).

Binary Search Tree (BST) Traversal

USC-Foundations of Artificial Intelligence Codes

Depth First Search Traversal

Breadth First Search Traversal

Tree traversal and manipulation in Java

Binary Tree Traversals and Views.

Java implementation of Huffman encoding and decoding from scratch. Includes custom tree traversal, compression, and decompression logic. Built in 2021.

This repository contains a Java implementation of a BinaryTree class, with methods for inserting nodes and performing in-order, pre-order, and post-order traversals.

Here are two samples of the tree structure and an ability to set traversing type in-depth or in-width

Builds heap according to selected time complexity algorithm.

Reads in the edges of a tree that has had a single edge added, and returns an edge that can be removed that will result in a tree

Sample solution to several programming questions.