sudhanshuptl

# Bubble sort in python
__author__ ='Sudhashu Patel'

class BubbleSort:
    def __init__(self, ls=[5,3,6,2,4,7,4,3]):
        self.ls = ls
        self.length = len(self.ls)

    def sort(self, reverse=False):
        if reverse:

sudhanshuptl

__author__='Sudhanshu Patel'
'''
Binary search tree implementation
# goes left if key less than node.key else right
1. insetion
2. Preorder
3. postorder
4. inorder traversal
5. find max depth
6. print all leaf node

sudhanshuptl

__author__='Sudhanshu Patel'
'''
Binary search tree implementation
# goes left if key less than node.key else right
1. insetion
2. Preorder
3. postorder
4. inorder traversal
5. find max depth
6. print all leaf node

sudhanshuptl

# One Way Link List
'''
1. Insertion at beginning
2. Insertion at end
3. Insertion at given postion
4. deletion from beginning
5. deletion from the end
6. deletion from given postion
'''
class Node:

csaez

# Mini-project #2 - "Guess the number"
#
# 'Introduction to Interactive Programming in Python' Course
# RICE University - coursera.org
# by Joe Warren, John Greiner, Stephen Wong, Scott Rixner

import simplegui
import random

# initialize global variables used in your code