Recent questions tagged tree

Let $T$ be a breadth-first search tree of a undirected graph. Let $(x, y)$ be an edge of $G$ that is not an edge of $T$, then one of $x$ or $y$ is an ancestor of the othe...

BFS is performed from the root of a binary tree containing $n$ vertices.For which type of binary tree can BFS require $\Theta(n)$ extra space in the worst case?A complete...

Let $G=(V,E)$ be a graph where its BFS tree contains at least 3 layers.Consider the cut $(L_0 \cup L_1,L_2)$, i.e., all nodes that are $2$ edges away from $s$ form one si...

If you perform a breadth-first search (BFS) on the given graph, starting from node $6$, which of the edges of the graph will be part of the BFS tree?Assume that ties are ...

 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 ...

$2-3-4$ trees are $\text{B}$ - trees of order $4$. They are isometric of ________ trees.AVLAA$2-3$Red-Black

Which of the following graphs are trees?Choose the correct answer from the options given below :$\text{(I)}$ and $\text{(II)}$ Only$\text{(I)}$, $\text{(II)}$ and $\text{...

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

Which of the following is false in the case of a spanning tree of a graph $\text{G}$?It is tree that spans $\text{G}$It is a subgraph of the $\text{G}$It includes every v...

Construct a B+ tree to insert the following number(order of the tree is 3) 3, 2, 5, 7, 6, 23, 24, 35, 67, 44, 43, 42, 17, 18, 19.

The preorder traversal of a binary search tree is $(10,5,1,7,40,50)$. The postorder traversal is$(1,5,7,10,40,50)$$(50,40,10,7,5,1)$$(1,7,5,10,40,50)$$(1,5,7,50,40,10)$ 

Let $k$ be a positive integer, and $n=2^{k}-1$. Let $X=\{1,2, \ldots, n\}$ be arranged as a min-heap stored in a complete binary tree, $T$.What can be the smallest possib...

Which of the following does not define a tree?A tree is a connected acyclic graph.A tree is a connected graph with $n-1$ edges where ' $n$ ' is the number of vertices in ...

Which of the following can be the sequence of nodes examined in a binary search tree while searching for key $98$?$100, 50, 75, 60, 98$$100,120,90,95,98$$200, 70, 100, 95...

Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0...

Let $U$ be a finite set and let $h$ be a function mapping $U \times U$ to $U$. Consider the following process that assigns values to all nodes of a complete binary tree w...

In GATE if questions just mention a tree then should we assume it to be a directed or undirected tree?Also, if we are having an undirected tree then does the child node c...