Discover artists through an infinite node graph

Data structures and algorithms in X minutes. Code examples from my YouTube channel.

Tree Implementation and Methods for Python, integrated with list, dictionary, pandas and polars DataFrame.

A PHP library providing an implementation of the modified preorder tree traversal (MPTT) algorithm

MySQL Tree Traversal practical examples

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

Parse complex json structures using a simple query syntax.

A utility for traversing decision trees by selecting options

Implementation of Data Structures in C

This is a C++ implementation of an AVL tree, which is a self-balancing binary search tree. An AVL tree maintains the balance factor of each node, which is the difference between the heights of its left and right subtrees. Whenever a node becomes unbalanced (its balance factor is either -2 or 2), the tree performs a rotation to restore the balance.

Generic and lazy tree traversal algorithms

tree search & walking the tree

Data structures implemented in various languages

Traversing Trees in constant space!!

Allow you to match any python objects hierarchy/trees in python with matching objects.

This app search string on web site

S-Expression Parser, Serializer, Interpreter, and Tree Constructor / Walker Utilities for JavaScript in Browsers and Node.js

Solved Challenges from HackerRank.

Binary Search Tree (BST) Traversal

An educational library

Java Data Structures Lab – Binary Trees Module: Learn to build, traverse, and analyze binary trees in Java, including preorder, inorder, postorder, level-order traversals, tree height, height-balanced checks, and LCA, with step-by-step examples and student activities.

JSON parser with extremely small memory footprint suitable for resource limited embedded systems

A C++ program that efficiently calculates the average values of nodes at each level in a binary tree, employing a level-order traversal approach for accurate and fast computation.

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.

Red-Black Trees is a Self-Balancing Binary Search Tree Where Each Node Contains an Additional Bit Representing It's Colour (Red / Black). The Colour Properties Maintain Balance for Efficient Operations (Insertion, Deletion & Searcing) in O(log n) Time Complexity

USC-Foundations of Artificial Intelligence Codes

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 Vertical Order Traversal

Data Structures and Algorithms in Python

A generic binary search tree implementation in C# featuring tree traversals, range search and rebalancing.