Computer Science - Data Structures - Binary Search Trees - BST Construction

8 questions about BST operations. Q1: Insert sequence [5,3,7,1,4,6,8] - what's the root? → 5 (first inserted). Q2: In the BST from Q1, searching for 4: which nodes are visited? → 5, 3, 4 (right of root=no because 4<5, go left to 3, then right to 4). Q3: In-order traversal of Q1's tree gives? → [1,3,