Questioin Name: Count Visible Nodes in Binary Tree

Question: In a binary tree, if in the path from root to the node A, there is no node with greater value than Aâ€™s, this node A is visible. We need to count the number of visible nodes in a binary tree. For example, in the following tree:

1 2 3 4 5 | 5 / \ 3 10 / \ / 20 21 1 |

Â There are four (4) visible nodes: 5, 20, 21, and 10.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 | import random # Definition for a binary tree node. # For simplification, we use binary tree to demo the algorithm. # But any kind of trees, it should work well. class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None def __str__(self, ind = 0): res = "t"*ind + str(self.val) + "n" if self.left == None: res += "t"*(ind+1) + "None" + "n" else: res += self.left.__str__(ind+1) if self.right == None: res += "t"*(ind+1) + "None" + "n" else: res += self.right.__str__(ind+1) return res @staticmethod def generateRandomBinaryTree(depth = 0): ''' Randomly generate a binary tree, for test. Set depth limit to prevent "maximum recursion depth exceeded" ''' guess = random.randint(0,3) if guess == 0 or depth == 20: return None else: root = TreeNode(random.randint(1,100)) root.left = TreeNode.generateRandomBinaryTree(depth+1) root.right = TreeNode.generateRandomBinaryTree(depth+1) return root @staticmethod def CountVisibleNodeRec(root, maxSoFar = None): ''' Recursive method to count the visible nodes ''' if root == None: # Empty tree return 0 assert isinstance(root, TreeNode) if maxSoFar == None: maxSoFar = root.val if maxSoFar <= root.val: # This is a visible node return TreeNode.CountVisibleNodeRec(root.left, root.val) + TreeNode.CountVisibleNodeRec(root.right, root.val) + 1 else: # Current node is not visible return TreeNode.CountVisibleNodeRec(root.left, maxSoFar) + TreeNode.CountVisibleNodeRec(root.right, maxSoFar) @staticmethod def CountVisibleNodeIte(root): ''' Iterative method to count the visible nodes ''' if root == None: # Empty tree return 0 # Each element in stack is a list as: [node, maxSoFar] stack = [[root, root.val]] count = 0 while len(stack) != 0: current = stack.pop() if current[0].val >= current[1]: # This is a visible node. count += 1 maxSoFar = max(current[0].val, current[1]) if current[0].left != None: stack.append([current[0].left, maxSoFar]) if current[0].right != None: stack.append([current[0].right, maxSoFar]) return count def main(): # Make the test case root = TreeNode.generateRandomBinaryTree() print "The count of visible nodes is (with recursive method):", TreeNode.CountVisibleNodeRec(root) print "The count of visible nodes is (with iterative method):", TreeNode.CountVisibleNodeIte(root) if __name__ == "__main__": main() |