السلام عليكم
الله يسعدكم اللي يعرف حل اتوضيح للاسئله يسعفني ومالي لكم الاالدعاء في ضهرالغيب
Construct SHOWING STEPs
:sa::sa::sa:
a) Binary Search Tree
b) Red Black Tree “
with the following keys: {1,2,3,4,5,6,7,8,9}
Question2: )
a) Construct a B-Tree of order 7with the following keys: (
{8, 96 , 91, 93, 25, 18, 10, 22, 4, 70, 41, 10, 37, 85, 1, 67, 92, 8, 54, 19}
b) A 2-3 tree is constructed as shown below: (
Delete SHOWING STEPs the following keys one after anther showing steps at each deletion: {31, 75}
Question3: ( )
a) In terms of Big O notation, in case of inserting (N) number of keys, analyze the difference between searching an item in binary search tree, a red black tree, and a B tree of order (x), knowing that keys are sorted in any order, explain your answer. (
Note: please show the base of log if used
b) In your own words, explain the effectiveness of using a B trees in File Structure, and how it optimizes I/O operations
الله يسعدكم اللي يعرف حل اتوضيح للاسئله يسعفني ومالي لكم الاالدعاء في ضهرالغيب
Construct SHOWING STEPs
:sa::sa::sa:
a) Binary Search Tree
b) Red Black Tree “
with the following keys: {1,2,3,4,5,6,7,8,9}
Question2: )
a) Construct a B-Tree of order 7with the following keys: (
{8, 96 , 91, 93, 25, 18, 10, 22, 4, 70, 41, 10, 37, 85, 1, 67, 92, 8, 54, 19}
b) A 2-3 tree is constructed as shown below: (
Delete SHOWING STEPs the following keys one after anther showing steps at each deletion: {31, 75}
Question3: ( )
a) In terms of Big O notation, in case of inserting (N) number of keys, analyze the difference between searching an item in binary search tree, a red black tree, and a B tree of order (x), knowing that keys are sorted in any order, explain your answer. (
Note: please show the base of log if used
b) In your own words, explain the effectiveness of using a B trees in File Structure, and how it optimizes I/O operations