AGI=AINST BST free handler
rather ttehn big numeber coems right and shott numebr comes left heree in thsitree we do least even come in any diection left or right or multipel brnaches
in here whatw e do we first make even number arrays and then we make oddnumebrs of array tehn primae numebrof arrays
thento do that rather then bst we perform even first then perform odd first and tehn prime
but howteh valuewill assgined it assginednormally rather thne left and right to alllocate it coudl go any wheres
like 2,4,6,8,10,12,14,16,18,20
2
tehen 4 in right or left directions
tehen 6 si in anyd riection tehen 8 is any driection
same way
for odd also for pime numebr to handle
now to serch we have sorted array of even and odd and prime
serahc in it happensby teh sorting arrays that makes ifnot then in it very level will serahc in both side
Comments
Post a Comment