Question: ` 1. Build a binary search tree for the words oenology, phrenology, campanology, ornithology, ichthyology, limnology, alchemy, and astrology using alphabetical order. (10 points) 2.

` 1. Build a binary search tree for the words oenology, phrenology,`

1. Build a binary search tree for the words oenology, phrenology, campanology, ornithology, ichthyology, limnology, alchemy, and astrology using alphabetical order. (10 points) 2. Construct the binary tree with prefix codes representing these coding schemes (10 points): a) a: 11, e: 0, t 101, s: 100 b) a:1, e: 01, t: 001, s: 0001, n: 00001 c)a: 1010, e: 0, t:11, s: 1011, n: 1001, i 10001 3. (10 points) a) Represent the expression ( +2) t3)(-(3+x)-5 using a binary tree Write this expression in b) prefix notation. c) postfix notation. d) infix notation. 4. What is the value of each of these postfix expressions? (10 points) a) 521--3 14 b)93/5+72-* c)32 2153-841 5. Draw all the spanning trees of the given simple graph given below: (10 points)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!