Write an algorithm to determine if two general trees are identical. Make the algorithm as efficient as you can. Analyze your algorithm’s running time.
Write a postorder traversal function for general trees, similar to the preorder traversal function named print given in Section 6.1.2.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here