Node searchHeap ( Node root, int searchValue ) { if ( root == null || searchValue < root.value ) return null; else if( searchValue == root.value ) return root; if ( (Node left = searchHeap ( root.left, searchValue )) != null ) return left; if ( (Node right = searchHeap ( root.right, searchValue )) != null ) return right; return null; }