Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following tree traversals work if the null left pointer pointing to the predecessor and null right pointer pointing to the successor in a binary tree?

Which of the following tree traversals work if the null left pointer pointing to the predecessor and null right pointer pointing to the successor in a binary tree? Correct Answer inorder, postorder, preorder traversals

In threaded binary trees, the null left pointer points to the predecessor and the right null pointer point to the successor. In threaded binary trees, we can use in-order, preorder and postorder traversals to visit every node in the tree.

Related Questions

Which is true regarding EIGRP successor routes?
1. A successor route is used by EIGRP to forward traffic to a destination.
2. Successor routes are saved in the topology table to be used if the primary route fails.
3. Successor routes are flagged as "active" in the routing table.
4. A successor route may be backed up by a feasible successor route.
5. Successor routes are stored in the neighbor table following the discovery process.
If a + b + c + d = 4, then find the value of $$\frac{1}{{\left( {1 - a} \right)\left( {1 - b} \right)\left( {1 - c} \right)}}$$     + $$\frac{1}{{\left( {1 - b} \right)\left( {1 - c} \right)\left( {1 - d} \right)}}$$     + $$\frac{1}{{\left( {1 - c} \right)\left( {1 - d} \right)\left( {1 - a} \right)}}$$     + $$\frac{1}{{\left( {1 - d} \right)\left( {1 - a} \right)\left( {1 - b} \right)}}$$     is?
If a + b + c + d = 4, then the value of $$\frac{1}{{\left( {1 - a} \right)\left( {1 - b} \right)\left( {1 - c} \right)}}$$     + $$\frac{1}{{\left( {1 - b} \right)\left( {1 - c} \right)\left( {1 - d} \right)}}$$     + $$\frac{1}{{\left( {1 - c} \right)\left( {1 - d} \right)\left( {1 - a} \right)}}$$     + $$\frac{1}{{\left( {1 - d} \right)\left( {1 - a} \right)\left( {1 - b} \right)}}$$     is?
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root. int height (treeptr n) { if (n == NULL) return -1;   if (n →  left == NULL)        if (n →  right == NULL) return 0;        else return ; \(\boxed{B1}\);     // Box 1 else { h1 = height (n →  left);          if (n → right == NULL) return (1+h1);          else { h2 = height (n → right);          return ; \(\boxed{B2}\)   // Box 2                        }            } } The appropriate expressions for the two boxes B1 and B2 are
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the 
The Hamiltonian of a particle is given by $$H = \frac{{{p^2}}}{{2m}} + V\left( {\left| {\overrightarrow {\bf{r}} } \right|} \right) + \phi \left( { + \left| {\overrightarrow {\bf{r}} } \right|} \right)\overrightarrow {\bf{L}} .\overrightarrow {\bf{S}} ,$$        where $$\overrightarrow {\bf{S}} $$ is the spin, $$V\left( {\left| {\overrightarrow {\bf{r}} } \right|} \right)$$  and $$\phi \left( {\left| {\overrightarrow {\bf{r}} } \right|} \right)$$  are potential functions and $$\overrightarrow {\bf{L}} \left( { = \overrightarrow {\bf{r}} \times \overrightarrow {\bf{p}} } \right)$$   is the angular momentum. The Hamiltonian does not commute with
The value of the expression $$\frac{{{{\left( {a - b} \right)}^2}}}{{\left( {b - c} \right)\left( {c - a} \right)}} + $$   $$\frac{{{{\left( {b - c} \right)}^2}}}{{\left( {a - b} \right)\left( {c - a} \right)}} + $$    $$\frac{{{{\left( {c - a} \right)}^2}}}{{\left( {a - b} \right)\left( {b - c} \right)}}$$   = ?
$$\frac{{{{\left( {4.53 - 3.07} \right)}^2}}}{{\left( {3.07 - 2.15} \right)\left( {2.15 - 4.53} \right)}} + \, $$     $$\frac{{{{\left( {3.07 - 2.15} \right)}^2}}}{{\left( {2.15 - 4.53} \right)\left( {4.53 - 3.07} \right)}} + \,\, $$     $$\frac{{{{\left( {2.15 - 4.53} \right)}^2}}}{{\left( {4.53 - 3.07} \right)\left( {3.07 - 2.15} \right)}}$$     is simplified to :
The quark content of $$\sum {^ + } ,\,{K^ - },\,{\pi ^ - }$$   and p is indicated: $$\left| {\sum {^ + } } \right\rangle = \left| {uus} \right\rangle ;\,\left| {{K^ + }} \right\rangle = \left| {s\overline u } \right\rangle ;\,\left| \pi \right\rangle = \left| d \right\rangle ;\,\left| p \right\rangle = \left| {uud} \right\rangle $$
In the process, $${\pi ^ - } + p \to {K^ - } + \sum {^ + } ,$$     considering strong interactions only, which of the following statements is true?