二叉树相关，数据结构定义，根据数组生成，前序遍历两种方式(递归和非递归)

Author: imbaliking

new_issue/data_sturct/binary_tree/binaryTree.py

@@ -0,0 +1,15 @@
+class binaryTreeNode:
+
+    def __init__(self,left_child,right_child,value):
+        self.left_child = left_child
+        self.right_child = right_child
+        self.value = value
+
+    def get_left_child(self):
+        return self.left_child
+
+    def get_right_node(self):
+        return self.right_child
+
+    def get_value(self):
+        return self.value

new_issue/data_sturct/binary_tree/initTree.py

@@ -0,0 +1,31 @@
+#coding:utf-8
+from binaryTree import binaryTreeNode
+
+def init_tree_from_list(data_list):
+
+    num = len(data_list)
+    node_list = [0 for _ in range(num)]
+    base_node = binaryTreeNode( None, None,data_list[0])
+    node_list[0] = base_node
+    for i in range(1,num):
+        if data_list[i] == None:
+            continue
+        new_node = binaryTreeNode(None, None, data_list[i])
+        node_list[i] = new_node
+        # 定位父节点
+        if i % 2 == 0:
+            op_node = node_list[i/2 - 1]
+            op_node.right_child = new_node
+        else:
+            op_node = node_list[(i+1)/2 - 1]
+            op_node.left_child = new_node
+
+
+    return base_node
+
+if __name__ == "__main__":
+    test_list = range(3)
+    base_node = init_tree_from_list(test_list)
+    print base_node.value
+    print base_node.left_child.value
+    print base_node.right_child.value

new_issue/data_sturct/binary_tree/preorderTraverse.py

@@ -0,0 +1,34 @@
+from binaryTree import binaryTreeNode
+from initTree import init_tree_from_list
+
+def preorder_traverse(node,op_func):
+    op_func(node)
+    if node.left_child != None:
+        preorder_traverse(node.left_child,op_func)
+
+    if node.right_child != None:
+        preorder_traverse(node.right_child,op_func)
+
+
+def preorder_traverse_nonRecursion(node,op_func):
+    stack = [node]
+
+    while len(stack) != 0:
+        op_node = stack.pop()
+        op_func(op_node)
+        if op_node.right_child != None:
+            stack.append(op_node.right_child)
+
+        if op_node.left_child != None:
+            stack.append(op_node.left_child)
+
+
+
+
+if __name__ == "__main__":
+    test_list = range(10)
+    base_node = init_tree_from_list(test_list)
+    def visit(node):
+        print node.value
+
+    preorder_traverse_nonRecursion(base_node,visit)