Data structures: Binary Tree @mycodeschool
Data structures: Binary Tree  @mycodeschool
Uploaded January 2014 | Updated September 2026, 2 weeks ago
See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

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: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool
Data structures: Binary TreeData Structures: List as abstract data typeLinked List in C/C++ - Insert a node at nth positionPointer types, pointer arithmetic, void pointersData structures: Introduction to Doubly Linked ListBubble sort algorithmPrint elements of a linked list in forward and reverse order using recursionReverse a linked list using recursionPointers as function arguments - call by referenceEvaluation of Prefix and Postfix expressions using stackData Structures: Linked List implementation of stacksIntroduction to linked list
mycodeschool |

Data structures: Binary Tree

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER