Hashing-Simple Hash and Merkle tree Does the output hash of simple hash and Merkle hash are same for same data>>??
No, they aren't, at least if you assume that the Merkle tree has a height of over 1 node, because in that case the "tree" would contain a single node and the two are equivalent. The height and amount of data / number of hashes per node are generally configured beforehand, and specifying 1 doesn't make sense.

A Merkle tree consists of multiple nodes, and each node consist of the hash of the underlying layer. That layer can consist either of other nodes or of data (I've not seen that data and nodes are mixed, and that would be dangerous practice). However, even for a two-height / two-node tree you would have $\text{H}(\text{H}(M))$ instead of just $\text{H}(M)$.

As finding a hash where $\text{H}(\text{H}(M)) = \text{H}(M)$ would amount to a collision, a secure hash will never output the same value for a hash and a Merkle tree.