Summary

A binary_search_tree stores comparable key values in node structures. The bst_property says left subtree keys are smaller and right subtree keys are larger. Core operations are search, insert, and delete. Average time is O(log n) when the tree is a balanced_tree; worst case is O(n) in a skewed_tree. in_order_traversal returns keys in sorted order. The top is the root, with left_child and right_child. Tree depth relates to height.