I was just wondering how I can traverse a binary tree using a while loop (not done recursively).

I have my tree:

```
typedef struct Node *BSTree;
typedef struct Node {
   int  key;
   BSTree left, right;
} Node;

```

I just want to know how I can access every single node in a while loop. Could someone show me that? I can't wrap my head around it.