This project has for goal to transform a n generic tree into a binary tree. Then we transform again this binary tree to make it proper, perfect and complete.

The generic tree is the following :

To transform the n generic tree into a binary tree we use the following set of rules :

• the root of the Binary Tree is the Root of the Generic Tree.
• the left child of a node in the Generic Tree is the Left child of that node in the Binary Tree.
• the right sibling of any node in the Generic Tree is the Right child of that node in the Binary Tree.

A perfect binary tree is a binary tree in which all interior nodes have two children and all leaves have the same depth or same level.

A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.

A full binary tree (sometimes referred to as a proper or plane or strict binary tree) is a tree in which every node has either 0 or 2 children.

-lcsfml-system -lcsfml-window -lcsfml-graphics