Here's an example of a Merkle tree drawn with Unicode box drawing symbols:

```

┌───────── Root Hash ──────────┐

│ │

┌────── Left Hash ───────┐ ┌────── Right Hash ───────┐

│ │

┌─ A Hash ─┐ ┌─ B Hash ─┐

│ │ │

A │ Data A │ B │ Data B │

```

In this example, the root hash contains the hashes of the left and right child nodes. Each of the child nodes contains the hash of two data inputs, which in turn may be a hash of individual data or more complex data structures. The lines between the boxes represent the branching structure of the tree, with horizontal lines indicating a parent-child relationship and vertical lines indicating sibling nodes.