Binary tree

  Create a binary tree. It doesn’t need to be a balanced tree so there is no need for an AVL or Red-Black implementation. After the tree is created, execute a method that accepts as parameters the tree and an integer level number. The method will return the number of nodes at that level. Assume the root is level zero.