Recent questions tagged binary-tree

Suppose a binary search tree has been constructed from the following sequence of numbers in the order in which they arrive : $6, 2, 10, 1, 5, 7, 11, 3, 9, 4, 8.$ Consider...

When the left sub-tree of the tree is one level higher than that of the right sub-tree, then the balance factor is _____________ .$0$$1$$-1$$2$

Total number of nodes at the $\text{n}^{th}$ level of a full binary tree can be given as _______________ .$\text{2n+1}$$\text{2n}^{2}$$2^\text{n}$$\text{2n-1}$

A complete $n$-ary tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complet...

A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...

The number of possible binary trees with $4$ nodes is$12$$13$$14$$15$

In a full binary tree number of nodes is $63$ then the height of the tree is :$2$$4$$3$$6$

Traversing a binary tree first root and then left and right subtrees called ______ traversal.postorder.preorder.inorder.none of these.

The number of unused pointers in a complete binary tree of depth $5$ is:$4$$8$$16$$32$

Which of the following need not be a binary tree?Search treeHeapAVL treeB tree