Module sulfa::tree [−][src]
Binary Tree
Modules
avl | Balanced Binary Tree Definition: The absolute value of the height difference between the left and right subtrees of each node of a binary tree does not exceed 1, and the left and right subtrees are both a balanced binary tree. |
bst | Binary Search Tree |
depth | Depth of Binary Tree |
order | Traverse the binary tree |
symmetric | Symmetric Binary Tree |
Structs
BinaryNode |
Type Definitions
OptBinaryNode |