See complete series on data structures here:
In this lesson, we have discussed binary tree in detail. We have talked about different types of binary tree like “complete binary tree”, “perfect binary tree” and “balanced binary tree” and their properties. We have also discussed how cost of operations in a tree may depend upon height of the tree and why we want a tree to be dense and its height to be minimum. Finally, we talked about two possible implementations of binary tree – a) using dynamically created nodes and b) using arrays.
For practice problems and more, visit:
Like us on Facebook:
Follow us on twitter: