I have a recursive function. My base case is:

somemethod(somelist)
if len(somelist) == 0
return
...


This is suppose to return the function to the place where it was called from.

Follows,

I need some help with fixing a bug in my program. I can't post the entire code here as its an on going assignment.

I'm building a Tree in Python.

class Tree:
def __init__(self,...

This is what I did:


class MyClass:
def __init__(self, f, r):
self.first = f
self.rest = r

def main(argv = sys.argv):
newclass = MyClass(" ", [])

Thanks mate cheers!

I was doing some research last night and I found this:

from collections import namedtuple

namedtuple("MyClass", "foo bar")

MyClass(foo=1, bar=2)

hello,

I wanna create a struct in python. the struct needs to have a char and an array of chars.

eg. (ruby code):


Somestruct = Struct .new(:character, :characterArray)
structure =...

Well I did that and I know what a Trie is. But coding it in a language you haven't used before is a challenge. I just want to know, when programing a data structure where do I begin. I already did...

I'm trying to code a Trie in Python. Any suggestions as to where I should begin?

drjay