course_tree.py

from course_tree_node import *

class CourseTree(object):

    def __init__(self,course_id):
        self.course_id = course_id
        self.root = CourseTreeNode("0")
        self.root.level = 0
        self.root.parent = None



    def get_courseid(self):
        return self.course_id

    def get_root(self):
        return self.root

    def insert(self,node):
        insert_new = True
        for child in self.root.get_children().values():
            if child.insert(node):
                insert_new = False
                break

        if insert_new:
            self.root.get_children()[node.id] = node
            node.level = 1
            node.parent = self.root
            # print node.id

        # merge 1 level nodes if they are the child of this node
        for child_id, root_child in self.root.get_children().items():
            if child_id in node.get_children().keys():
                id_to_del = child_id
                node.get_children()[id_to_del] = root_child
                del self.root.get_children()[id_to_del]
                root_child.set_level(node.get_level() + 1)
                root_child.parent = node








    def print_tree(self):
        print "----TREE---------" + self.course_id + "------"
        for id,child in self.root.get_children().items():
            if child is None:
                print "(" + id + ")"
            else:
                child.print_node_and_children()


    def print_node_path(self,id):
        if self.root.find_node_parent(id):
            print id + "/",
            self.root.find_node_parent(id).print_parents()


    def find(self,id):
        return self.root.find_node(id)