Traverses given tree in Inorder fashion and prints all nodes that have both children as non - empty .
public class FullNodes { static void findFullNode ( Node root ) { if ( root != null ) { findFullNode ( root . left ) ; if ( root . left != null && root . right != null ) Console . Write ( root . data + " ▁ " ) ; findFullNode ( root . right ) ; } }