Page 1 of 1
Question-1: a) (10 points) Construct a Binary Search Tree by inserting the following sequence of numbers: 15, 25, 30, 27
Posted: Thu May 05, 2022 1:38 pm
by answerhappygod
- Question 1 A 10 Points Construct A Binary Search Tree By Inserting The Following Sequence Of Numbers 15 25 30 27 1 (28.79 KiB) Viewed 35 times
Question-1: a) (10 points) Construct a Binary Search Tree by inserting the following sequence of numbers: 15, 25, 30, 27, 20, 10, 12, 5, 3 and 29 b) (9 points) Based on the tree constructed in (a), answer the following questions: 1. Pre-order traversal: ii. In-order traversal: i. Height of the tree: