A tree is a recursive data structure because each node has a reference to its other subtrees. e.g. the following binary tree:
has two binary trees as its children, which are:
This property of the binary tree is applicable at all lavels of binary trees.