Binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
What is a binary tree What is the difference between a binary tree and a Binary Search Tree What is the possible gain in terms of time complexity compared to linked lists What are the depth, the height, the size of a binary tree What are the different traversal methods to go through a binary tree What is a complete, a full, a perfect, a balanced binary tree
Types of binary trees
- Full Binary Tree
- Complete Binary Tree
- Perfect Binary Tree
- Balanced Binary Tree
- Degenerate Binary Tree
Binary Tree Components
- Data element
- Pointer to left subtree
- Pointer to right subtree
- David Alzate <Illker>