4. Balanced binary tree searching
- A binary tree is a relationship of keys such that the examination of any key leads
to one of two other keys
- The binary tree is actually in the form of an index containing all the keys together
with a directory showing the braches stemming left and right from each key
- Binary tree searching is suitable for an unsequenced file
- The search is similar to binary searching in that each key examination holves the
rinaining keys, on average
Chapter 11: INTRODUCTION TO ARTIFICAL INTELLIGENCE.
Question 1. AI?
Atificial Intelligence
It has three braches
Bạn đang xem 4. - MOT SO CAU HOI VE MAY TINH
