Density of binary tree in single Traversal

Density of tree is calculate by total number of tree elements are divided by height of tree. This problem can easily solved by to calculate Total nodes of tree and also find the Height of tree.

Here given code implementation process.

1) Density of binary tree in one traversal in java 2) Density of binary tree in one traversal in c++ 3) Density of binary tree in one traversal in c 4) Density of binary tree in one traversal in c# 5) Density of binary tree in one traversal in vb.net 6) Density of binary tree in one traversal in php 7) Density of binary tree in one traversal in node js 8) Density of binary tree in one traversal in python 9) Density of binary tree in one traversal in ruby 10) Density of binary tree in one traversal in scala 11) Density of binary tree in one traversal in swift 12) Density of binary tree in one traversal in kotlin 13) Density of binary tree in one traversal in typescript 14) Density of binary tree in one traversal in golang