DataStructures / Data structures Interview questions
What are the different types of binary tree?
A rooted binary tree has a root node and every node has at most two children.
A full binary tree (proper or plane binary tree) is a tree in which every node in the tree has either 0 or 2 children.
A Complete Binary Tree has all levels completely filled except possibly the last level and the last level has all keys as left as possible.
In Perfect Binary Tree all internal nodes have two children and all leaves are at same level.
A binary tree is balanced if height of the tree is O(Log n) where n is number of nodes.
A degenerate (or pathological) tree is a tree where every internal node has one child. Such trees are performance-wise same as linked list.
More Related questions...