## What is the difference between binary tree and general tree?

General tree is a tree in which each node can have many children or nodes . Whereas in binary tree, each node can have at most two nodes . The subtree of a general tree do not hold the ordered property.

**How do you insert into a binary tree?**

Insertion in a Binary Tree in level order. Given a binary tree and a key, insert the key into the binary tree at first position available in level order. The idea is to do iterative level order traversal of the given tree using queue. If we find a node whose left child is empty, we make new key as left child of the node.

### What are the properties of a binary tree?

Properties of binary tree. A binary tree can be either empty (without any nodes), or consists of only one node (root node), or consists of a root node with two binary sub-trees called left sub-tree and right sub-tree. A binary tree with no nodes is called NULL tree. The tree can have maximum of 2 h leaf nodes (leaves).

**Why to use binary search tree?**

The main reason to use a binary search tree is the fact that it extends the capability of a normal array. An array is a data type that stores data points contiguously in sequence.

#### What are the characteristics of a binary tree?

Characteristics A binary tree consists of a number of nodes that contain the data to be stored (or pointers to the data), and the following structural characteristics : Figure 12-1 illustrates the structure of a binary tree. A leaf is a node that has no children. An important property of a binary tree is its height.

**What are the properties of binary tree?**

Let’s now focus on some basic properties of a binary tree: A binary tree can have a maximum of nodes at level if the level of the root is zero. When each node of a binary tree has one or two children, the number of leaf nodes (nodes with no children) is one more than the number of nodes that There exists a maximum of nodes in a binary tree if its height is , and the height of a leaf node is one.

## How do you balance a binary tree?

A binary tree is balanced if for each node it holds that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.