The program demonstrates the construction of a Binary Search Tree and Morris In-Order Traversal. Input the number of nodes, then input the nodes in the order of insertion. When doing Morris Traversal, some edges will disappear and new ones appear. The edges in the original tree are blue, and the new edges are green, indicating that the direction is pointing up.
Thanks to everyone in the group. ORZ The original problem in DSA HW2 really annoyed my teammates. They want to take revenge on it >:(
