A binary tree good for testing general algorithms

Can someone draw the smallest possible binary tree which is ideal for testing(cover the most cases) general algorithm like pre/in/post order traversal, search etc?