Data structure (Python)
BY LEVEL TRAVERSAL TEST 1 (0.0/2.5)
Description : This is the same test as in PDF Examples
Input : TREE pre order { 10, 5, 7, 20, 15, 12, 17 }
: TREE post order { 7, 5, 12, 17, 15, 20, 10 }
: Operation - by_level_traversal
Expected : TREE pre order { 10, 5, 7, 20, 15, 12, 17 }
: TREE post order { 7, 5, 12, 17, 15, 20, 10 }
: Method return value = QUEUE { 10, 5, 20, 7, 15, 12, 17 }
Student : TREE pre order { 10, 5, 7, 20, 15, 12, 17 }
: TREE post order { 7, 5, 12, 17, 15, 20, 10 }
: Method return value = QUEUE { 10, 5, 20, 7, 15 }
Test Failed: False is not true
BY LEVEL TRAVERSAL TEST 2 (0.0/2.5)
Description : BST by_level_traversal: Testing with random values
Input : TREE pre order { -86268, -98171, -95443, -98171, -98171, 89478, 24962, -14051, -62312, -68539, -74848, -77153, -86268, -74848, -67100, -68539, -63422, -37280, -57726, -37280, -37280, -31709, -37280, -31303, -23099, -23099, 18331, 8433, -7240, -10362, -14051, -14051, -10362, -10362, 2767, -1242, -7240, -7240, -1432, 3065, 2767, 2767, 3065, 3065, 11149, 8433, 11149, 11149, 18326, 11149, 18326, 18331, 52525, 36635, 35940, 24962, 27683, 27683, 60339, 56746, 53519, 52525, 53519, 56521, 58190, 56746, 60339, 62292, 60339, 60339, 73971, 65312, 62704, 62292, 62292, 62704, 62704, 73971, 97449, 97712, 97449, 97449, 97712, 97712 }
: TREE post order { -98171, -98171, -95443, -98171, -86268, -77153, -74848, -74848, -68539, -63422, -67100, -68539, -57726, -37280, -23099, -23099, -31303, -31709, -37280, -37280, -37280, -62312, -14051, -14051, -10362, -10362, -10362, -1432, -7240, -7240, -1242, 2767, 2767, 3065, 3065, 3065, 2767, -7240, 8433, 11149, 18326, 18326, 11149, 11149, 11149, 8433, 18331, 18331, -14051, 27683, 27683, 24962, 35940, 36635, 52525, 56521, 53519, 53519, 56746, 58190, 56746, 60339, 60339, 62292, 62292, 62704, 62704, 62704, 65312, 73971, 73971, 62292, 60339, 60339, 52525, 24962, 97449, 97449, 97712, 97712, 97712, 97449, 89478, -86268 }
: Operation - by_level_traversal
Expected : TREE pre order { -86268, -98171, -95443, -98171, -98171, 89478, 24962, -14051, -62312, -68539, -74848, -77153, -86268, -74848, -67100, -68539, -63422, -37280, -57726, -37280, -37280, -31709, -37280, -31303, -23099, -23099, 18331, 8433, -7240, -10362, -14051, -14051, -10362, -10362, 2767, -1242, -7240, -7240, -1432, 3065, 2767, 2767, 3065, 3065, 11149, 8433, 11149, 11149, 18326, 11149, 18326, 18331, 52525, 36635, 35940, 24962, 27683, 27683, 60339, 56746, 53519, 52525, 53519, 56521, 58190, 56746, 60339, 62292, 60339, 60339, 73971, 65312, 62704, 62292, 62292, 62704, 62704, 73971, 97449, 97712, 97449, 97449, 97712, 97712 }
: TREE post order { -98171, -98171, -95443, -98171, -86268, -77153, -74848, -74848, -68539, -63422, -67100, -68539, -57726, -37280, -23099, -23099, -31303, -31709, -37280, -37280, -37280, -62312, -14051, -14051, -10362, -10362, -10362, -1432, -7240, -7240, -1242, 2767, 2767, 3065, 3065, 3065, 2767, -7240, 8433, 11149, 18326, 18326, 11149, 11149, 11149, 8433, 18331, 18331, -14051, 27683, 27683, 24962, 35940, 36635, 52525, 56521, 53519, 53519, 56746, 58190, 56746, 60339, 60339, 62292, 62292, 62704, 62704, 62704, 65312, 73971, 73971, 62292, 60339, 60339, 52525, 24962, 97449, 97449, 97712, 97712, 97712, 97449, 89478, -86268 }
: Method return value = QUEUE { -86268, -98171, 89478, -95443, 24962, 97449, -98171, -14051, 52525, 97712, -98171, -62312, 18331, 36635, 60339, 97449, 97712, -68539, -37280, 8433, 18331, 35940, 56746, 60339, 97449, 97712, -74848, -67100, -57726, -37280, -7240, 11149, 24962, 53519, 58190, 62292, -77153, -74848, -68539, -63422, -37280, -10362, 2767, 8433, 11149, 27683, 52525, 53519, 56746, 60339, 73971, -86268, -31709, -14051, -10362, -1242, 3065, 11149, 27683, 56521, 60339, 65312, 73971, -37280, -31303, -14051, -10362, -7240, 2767, 3065, 18326, 62704, -23099, -7240, 2767, 3065, 11149, 18326, 62292, 62704, -23099, -1432, 62292, 62704 }
Student : TREE pre order { -86268, -98171, -95443, -98171, -98171, 89478, 24962, -14051, -62312, -68539, -74848, -77153, -86268, -74848, -67100, -68539, -63422, -37280, -57726, -37280, -37280, -31709, -37280, -31303, -23099, -23099, 18331, 8433, -7240, -10362, -14051, -14051, -10362, -10362, 2767, -1242, -7240, -7240, -1432, 3065, 2767, 2767, 3065, 3065, 11149, 8433, 11149, 11149, 18326, 11149, 18326, 18331, 52525, 36635, 35940, 24962, 27683, 27683, 60339, 56746, 53519, 52525, 53519, 56521, 58190, 56746, 60339, 62292, 60339, 60339, 73971, 65312, 62704, 62292, 62292, 62704, 62704, 73971, 97449, 97712, 97449, 97449, 97712, 97712 }
: TREE post order { -98171, -98171, -95443, -98171, -86268, -77153, -74848, -74848, -68539, -63422, -67100, -68539, -57726, -37280, -23099, -23099, -31303, -31709, -37280, -37280, -37280, -62312, -14051, -14051, -10362, -10362, -10362, -1432, -7240, -7240, -1242, 2767, 2767, 3065, 3065, 3065, 2767, -7240, 8433, 11149, 18326, 18326, 11149, 11149, 11149, 8433, 18331, 18331, -14051, 27683, 27683, 24962, 35940, 36635, 52525, 56521, 53519, 53519, 56746, 58190, 56746, 60339, 60339, 62292, 62292, 62704, 62704, 62704, 65312, 73971, 73971, 62292, 60339, 60339, 52525, 24962, 97449, 97449, 97712, 97712, 97712, 97449, 89478, -86268 }
: Method return value = QUEUE { -86268, -98171, 89478, -95443, 24962, 97449, -98171, -14051, 52525, 97712, -98171, -62312, 18331, 36635, 60339, 97449, 97712, -68539, -37280, 8433, 18331, 35940, 56746, 60339, 97449, 97712, -74848, -67100, -57726, -37280, -7240, 11149, 24962, 53519, 58190, 62292, -77153, -74848, -68539, -63422, -37280, -10362, 2767, 8433, 11149, 27683, 52525, 53519, 56746, 60339, 73971, -86268, -31709, -14051, -10362, -1242, 3065, 11149, 27683, 56521, 60339, 65312, 73971, -37280, -31303, -14051, -10362, -7240, 2767, 3065, 18326, 62704, -23099, -7240, 2767, 3065, 11149, 18326, 62292, 62704 }
Test Failed: False is not true
Description : This is the same test as in PDF Comprehensive Examples
Input : TREE pre order { 10 }
: TREE post order { 10 }
: Operation - count_unique()
Expected : TREE pre order { 10 }
: TREE post order { 10 }
: Method return value = 1
Student : TREE pre order { 10 }
: TREE post order { 10 }
: Method return value = 0
Test Failed: False is not true
Description : This is the same test as in PDF Comprehensive Examples
Input : TREE pre order { 10, 5 }
: TREE post order { 5, 10 }
: Operation - is_perfect()
Expected : TREE pre order { 10, 5 }
: TREE post order { 5, 10 }
: Method return value = False
Student : TREE pre order { 10, 5 }
: TREE post order { 5, 10 }
: Method return value = True
Test Failed: False is not true
POST ORDER TRAVERSAL TEST 1 (0.0/1.5)
Description : This is the same test as in PDF Examples
Input : TREE pre order { 10, 5, 7, 20, 15, 12, 17 }
: TREE post order { 7, 5, 12, 17, 15, 20, 10 }
: Operation - post_order_traversal
Expected : TREE pre order { 10, 5, 7, 20, 15, 12, 17 }
: TREE post order { 7, 5, 12, 17, 15, 20, 10 }
: Method return value = QUEUE { 7, 5, 12, 17, 15, 20, 10 }
Student : TREE pre order { 10, 5, 7, 20, 15, 12, 17 }
: TREE post order { 7, 5, 12, 17, 15, 20, 10 }
: Method return value = QUEUE { 5, 7, 20, 15, 12, 17, 10 }
Test Failed: False is not true
POST ORDER TRAVERSAL TEST 2 (0.0/1.5)
Description : BST post_order_traversal: Testing with random values
Input : TREE pre order { 6030, -781, -54150, -88888, -95907, -88888, -88888, -88888, -54150, 909, -781, 909, 55591, 54714, 6030, 54714, 54714, 95790, 70552, 55591, 68258, 68021, 55591, 68258, 89818, 70552, 89818, 93578 }
: TREE post order { -95907, -88888, -88888, -88888, -88888, -54150, -54150, -781, 909, 909, -781, 6030, 54714, 54714, 54714, 55591, 68021, 68258, 68258, 55591, 70552, 93578, 89818, 89818, 70552, 95790, 55591, 6030 }
: Operation - post_order_traversal
Expected : TREE pre order { 6030, -781, -54150, -88888, -95907, -88888, -88888, -88888, -54150, 909, -781, 909, 55591, 54714, 6030, 54714, 54714, 95790, 70552, 55591, 68258, 68021, 55591, 68258, 89818, 70552, 89818, 93578 }
: TREE post order { -95907, -88888, -88888, -88888, -88888, -54150, -54150, -781, 909, 909, -781, 6030, 54714, 54714, 54714, 55591, 68021, 68258, 68258, 55591, 70552, 93578, 89818, 89818, 70552, 95790, 55591, 6030 }
: Method return value = QUEUE { -95907, -88888, -88888, -88888, -88888, -54150, -54150, -781, 909, 909, -781, 6030, 54714, 54714, 54714, 55591, 68021, 68258, 68258, 55591, 70552, 93578, 89818, 89818, 70552, 95790, 55591, 6030 }
Student : TREE pre order { 6030, -781, -54150, -88888, -95907, -88888, -88888, -88888, -54150, 909, -781, 909, 55591, 54714, 6030, 54714, 54714, 95790, 70552, 55591, 68258, 68021, 55591, 68258, 89818, 70552, 89818, 93578 }
: TREE post order { -95907, -88888, -88888, -88888, -88888, -54150, -54150, -781, 909, 909, -781, 6030, 54714, 54714, 54714, 55591, 68021, 68258, 68258, 55591, 70552, 93578, 89818, 89818, 70552, 95790, 55591, 6030 }
: Method return value = QUEUE { -781, -54150, -88888, -95907, -88888, -88888, -88888, -54150, 909, -781, 909, 55591, 54714, 6030, 54714, 54714, 95790, 70552, 55591, 68258, 68021, 55591, 68258, 89818, 70552, 89818, 93578, 6030 }
Test Failed: False is not true