Binary Tree Visible Nodes Counting

Hi, today I would like to share with you solution of the code puzzle with binary tree. There are 2 trees examples t1 and t2 and your job is to find visible nodes and visible nodes are that are not smaller then all parents. When you go down for t1 tree you can find 4 such visible nodes. And for the second tree there are 2 nodes that are visible. Important thing is that the root node Continue ReadingBinary Tree Visible Nodes Counting