Computer Science - Data Structures - Trees (binary trees) - Tree Traversal Practice

Given a binary tree diagram, arrange node values in the correct traversal order. Tree: 1 / \\ 2 3 / \\ \\ 4 5 6. Task 1 (In-order): Arrange: [4, 2, 5, 1, 3, 6] (Left, Root, Right). Task 2 (Pre-order): Arrange: [1, 2, 4, 5, 3, 6] (Root, Left, Right). Task 3 (Post-order): Arra