Recent questions tagged binary-tree

A binary tree has:$1000$ nodes in the left subtree $100$ nodes in the right subtreeHow many nodes are processed before the root in preorder, inorder, and postorder traver...

A binary tree has:Left subtree containing $1000$ nodes Right subtree containing $100$ nodesHow many nodes are processed before the root in preorder, inorder, and postorde...

Which of the following functions correctly returns the total number of nodes in a binary tree rooted at $\texttt{t}$?int tree_size(TreeNode *t) { if (t == NULL) return 0;...

Consider the following binary tree:Which option correctly gives the preorder, postorder, inorder, and level-order traversals?Preorder $:\texttt{9 15 23 12 8 6 2 7 10 5 35...

Which of the following can be the number of nodes in a complete binary tree?$2$ $5$ $7$ $8$

A node of a binary tree is called nearly balanced if one of the following holds:The node is a leaf. The node has one child and that child is a leaf. The node has two chil...

A complete binary tree is stored in an array using $\mathbf{1}$-based indexing, where the root is stored at index $1$.For a node stored at index $11$, which of the follow...

A binary tree has height $4$, where height is measured as the maximum number of edges from the root to a leaf.Can such a binary tree have exactly $8$ leaves?Yes, because ...

Is it possible to construct a full binary tree with exactly $8$ internal nodes and $7$ leaves?Yes No

The inorder and preorder traversal of binary tree are $\mathrm{d}, \mathrm{b}, \mathrm{e}, \mathrm{a}, \mathrm{f}, \mathrm{c}, \mathrm{g}$ and $\mathrm{a}, \mathrm{b}, \m...

The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with $23$ no...

The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree.What is the maximum possible height of a full binary tree with ...

The maximum and minimum size of an array needed to store a binary tree with $15$ nodes aremaximum : $32767$, minimum : $15$maximum : $16384$, minimum : $16$maximum : $327...

 Considering above binary tree, what will be the inorder traversal$\text{BADCEGFH}$$\text{GHFEDCBA}$$\text{BACDEGFH}$$\text{GHFDEBCA}$

Arrange the following steps of the Inorder Traversal of Binary Tree in the correct order.Visit the Left subtreeVisit the Root nodeVisit the Right subtreeStart traversing ...

We have an array $A$ of $n$ numbers, where $n$ is a power of $2$.We build a full binary tree on top of the array $A.$ The elements of the array are leaves of the tree, nu...

We have an array $A$ of $n$ numbers, where $n$ is a power of $2$.We build a full binary tree on top of the array $A.$ The elements of the array are leaves of the tree, nu...

Which traversal method can be used to print the nodes of a binary tree in ascending order?Pre-order traversalPost-order traversalIn-order traversalLevel-order traversal

Stack size in the case of a balanced Binary Tree is logn (Best Case) and in case of unbalanced Binary Tree is n (Worst Case), what is 'n' here?

We have an array $A$ of $n$ numbers, where $n$ is a power of $2$.We build a full binary tree on top of the array $A.$ The elements of the array are leaves of the tree, nu...