Frequently Asked Questions on C Binary Tree

What is a binary tree? 

A binary tree is a special type of data structure where each node has at most two children called as left and right child nodes.

What are the applications of Binary Tree?

Binary tree are used in the variety of applications:

1. Binary Search Trees(BST)
2. Heaps
3. Expression Trees
4. Huffman Trees
5. Binary Trees

What is the time complexities of basic operations on a Binary Tree?

1. The time complexity of insertion operation is O(h).
2. The time complexity of search operation is O(h).
3. The time complexity of deletion operation is O(h).
4. The time complexity of traversal operation is O(n).

Here, h is the height of the tree. n is the number of nodes in the tree.

What are the different types of Binary Tree?

The following are the type of binary trees:

• According to Number of Children
  • Full Binary Tree
  • Degenerate Binary Tree
  • Skewed Binary Trees
• According to Completion of Levels
  • Complete Binary Tree
  • Perfect Binary Tree
  • Balanced Binary Tree
• According to Node Values
  • Binary Search Tree
  • AVL Tree
  • Red Black Tree
  • B Tree
  • B+ Tree
  • Segment Tree

What is a balanced binary tree?

A balanced binary tree is also called as height-balanced binary tree, it is a type of binary tree in which the height of the left and right subtree of any node differs by not more than one.

What is Complete Binary Tree?

A complete binary tree is the type of the binary tree in which all levels are completely filled except the possibility the last level, and last level have all keys as left as possible. This type of the binary tree is used in implementation of the binary heaps.

What is AVL Tree?

An AVL tree is the self-balanced binary search tree where difference in the heights between left and right subtree of the node is atmost one. AVL trees are provide the faster search times compared to the unbalanced binary search trees by the maintaining the balanced structure.

A binary tree is a non-linear hierarchical data structure in which each node has at most two children known as the left child and the right child. It can be visualized as a hierarchical structure where the topmost node is called the root node and the nodes at the bottom are called leaf nodes or leaves.

In this article, we will learn the basics of binary trees, types of binary trees, basic operations that can be performed on binary trees as well as applications, advantages, and disadvantages of binary trees in C.