zoukankan      html  css  js  c++  java
  • Code2

     

     


    def display(tree): #In Order traversal of the tree

        if tree is None:
            return

        if tree.left is not None:
            
            display(tree.left)

        print(tree.data)

        if tree.right is not None:
            display(tree.right)

        return

     

    def depth_of_tree(tree): #This is the recursive function to find the depth of binary tree.
        if tree is None:
            return 0
        else:
            depth_l_tree = depth_of_tree(tree.left)
            depth_r_tree = depth_of_tree(tree.right)
            if depth_l_tree > depth_r_tree:
                return 1 + depth_l_tree
            else:
                return 1 + depth_r_tree


    def is_full_binary_tree(tree): # This functions returns that is it full binary tree or not?
        if tree is None:
            return True
        if (tree.left is None) and (tree.right is None):
            return True
        if (tree.left is not None) and (tree.right is not None):
            return (is_full_binary_tree(tree.left)
     and is_full_binary_tree(tree.right))
        else:
            return False

  • 相关阅读:
    GUI树组件,表格
    GUI对话框
    java事件处理5(窗口,窗口坐监视器
    java事件处理4(焦点,键盘
    java事件处理3
    java事件处理2
    2
    sql查询语句心得
    The 2018 ACM-ICPC Chinese Collegiate Programming Contest Maximum Element In A Stack
    cf 1006E
  • 原文地址:https://www.cnblogs.com/binyang/p/10897482.html
Copyright © 2011-2022 走看看