TOPIC: Binary Tree

DEFINITION: 
A binary tree is a data structure in which each node has at most two children, referred to as the left child and the right child. This structure allows for efficient storage and retrieval of data, particularly when the data has a hierarchical relationship. It solves the problem of organizing and searching large amounts of data by providing a systematic way to traverse and access the data.

TIME_COMPLEXITY: 
The time complexity of binary tree operations such as search, insert, and delete can vary: O(1) for the best case when the tree is balanced and the operation is performed at the root, O(log n) for the average case when the tree is balanced, and O(n) for the worst case when the tree is skewed.

SPACE_COMPLEXITY: 
The space complexity of a binary tree is O(n), where n is the number of nodes in the tree, since each node requires a constant amount of space to store its value and references to its children.

USE_WHEN: 
Use a binary tree when you need to store and retrieve data efficiently, especially when the data has a natural hierarchical structure, such as a file system or a database index. It's also useful when you need to perform operations like insertion, deletion, and search frequently.

AVOID_WHEN: 
Avoid using a binary tree when the data is too large to fit into memory or when the tree becomes severely unbalanced, leading to poor performance. In such cases, consider using other data structures like hash tables or self-balancing trees like AVL or Red-Black trees.

EXAMPLE: 
Suppose we have a binary tree with the following nodes: 
        4
       / \
      2   6
     / \   \
    1   3   5
To insert a new node with value 7, we start at the root (4) and move to the right child (6), then to the right child again (which doesn't exist), so we create a new node (7) as the right child of 6:
        4
       / \
      2   6
     / \   / \
    1   3 5   7 
The resulting tree is now: 
        4
       / \
      2   6
     / \   / \
    1   3 5   7 
Result: 

REAL_WORLD_ANALOGY: 
A binary tree can be thought of as a family tree, where each person (node) has at most two children, and the relationships between family members are organized in a hierarchical structure.

SOURCE_NOTE: 
Concepts referenced from general knowledge of data structures and algorithms.