Trees

Threaded binary tree

A BST with a separate root header, internal inorder threads, and two outer threads returning to the header.

Learn with an interactive visualization

Category: Trees. Complexity: Average O(log n) · Traversal O(n).

A BST with a separate root header, internal inorder threads, and two outer threads returning to the header. Interactive visualization, Java and C++ code,…