알고리즘: 이진 트리 경로 길이 구하기

class TNode: def __init__ (self,data, left, right): self.data = data self.left = left self.right = right def count_node(n): if n is None: return 0 else: return 1+count_node(n.left) + count_node(n.right) def path_length(root,totalNodes): if (totalNodes == 1)or(totalNodes==0) : return 0; noOfNodes1 = count_node(root.left) noOfNodes2 = count_node(root.right) return ( path_length(root.left, noOfNode..