Problem
1. Extend the concept of an Euler tour to an ordered tree that is not necessarily a binary tree.
2. Design an algorithm for drawing general trees that generalizes the inorder traversal approach for drawing binary trees.
3. Design an alternative implementation of the linked data structure for proper binary trees using a class for nodes that specializes into subclasses for an internal node, an external node, and the root node.