a full binary tree is deine as follows. $1.$ a single vertex is a full binary tree and the vertex is called the root$\mathrm{.}2.$ if T$1$ and T$2$ are full binary trees with roots r$1$ and r$2$ repectively then the binary tree constructed below is a full binary tree with root r$.$