7. a) Draw a complete binary tree with exactly 9 nodes. Put a different value in each node. b) Write an algorithm or program that, in a binary tree, finds the number of nodes that contain a negative value. (Perform a traversal, if the value is positive increment a counter at each visited node.)