Suppose you have a binary tree containing N nodes. Each node has a Name, a LeftChild and a RightChild. Write a C++ function to print the tree by levels. Print the root first, then all the children of the root, then all the grandchildren of the root, etc.Your algorithm must take O(n) time.
- Provide an implementation for: void printNodes(const Node * root);
- What assumptions does your code make?
- Did you use a computer to do this?
- How long did it take to do this question?
Comments (0)
