Threaded Binary search tree
Implementation of a threaded binary search tree. Similar to a binary search tree. The only difference is that every leaf in the tree will also keep track of a predecessor and a successor node.
AI
AI 요약: This codebase represents a historical implementation of the logic described in the metadata. Our preservation engine analyzes the structure to provide context for modern developers.
소스 코드
Upload
원본 댓글 (3)
Wayback Machine에서 복구됨