brain

Let the vertex set be ${V_1,V_2,V_3}$ and let the arc set consist of e_1: V_1 \to V_2, \qquad e_2: V_1 \to V_3.

False.

Let P=(e_1,e_2,\ldots,e_n) be an oriented walk from $V$ to $V'$.

Suppose first that the graph is connected.

The construction extends naturally to a multigraph, where several edges may join the same pair of vertices and loops are also permitted.

The terminals $T_1,T_2,\ldots,T_n$ correspond naturally to the vertices of a graph, and the wires correspond to edges connecting pairs of vertices.

Let $e=T_{n-1}T_n$ be an edge of minimum cost among all edges incident with $T_n$, so that $c(n-1,n)=\min_{1\le i<n}c(i,n)$.

Let the original flow chart have vertex set $V$ and edge set $E$, and let the reduced chart be obtained by partitioning $V$ into disjoint blocks $V^{(1)},\ldots,V^{(r)}$ and replacing each block by a...

Let $G'$ be the chosen free subtree and let the independent variables be the values assigned to the non-tree edges $E_2,E_5,\ldots,E_{25}$, as in Eq.

The construction in this exercise depends on the exact adjacency structure of the flow chart in Fig.

Construct an adjacency representation of the graph from the pairs $(a_1,b_1),\ldots,(a_m,b_m)$, interpreting each edge $e_i$ as joining $V_{a_i}$ to $V_{b_i}$.

Let $G'$ be a finite free tree with $n$ vertices and $n-1$ edges, and assume Kirchhoff’s law (1) holds at every vertex with all vertex values equal to $0$, so that at each vertex the sum of $E$’s ente...

Let $(V_0,V_1,\ldots,V_n)$ be a walk from $V$ to $V'$.

The fundamental path from Start to Stop is the path in the free subtree determined by the cycle $C_0$ with $e_0$ omitted: e_1+e_3+e_4+e_6+e_7+e_9+e_{10}+e_{11}+e_{12}+e_{14}.

[Section 2.

We are asked to reason about **descendant number sequences** in preorder.

Let the forest be given in preorder sequential representation: - `INFO1[j]` contains the node information.

In Fig.

[Section 2.

[Section 2.

Let the given forest be represented in postorder with degrees as in representation `(9)`.

The ordinary Algorithm `E` maintains a forest of equivalence classes.

Step `A8` is reached only when Algorithm `A` has determined that the two terms currently under consideration correspond to the same power of the same variable, so that their coefficients must be combi...

[Section 2.

Associate with each root $r$ an integer $\mathrm{SIZE}(r)$ equal to the number of nodes in its tree.

We are asked to design an algorithm that answers the query "`Is $j \equiv k$?

The relation $9 \equiv 3$ serves only to place the element $9$ into the equivalence class containing $3$.

We are asked to give a table analogous to `(15)` and a diagram analogous to `(16)` showing the trees present after Algorithm `E` has processed all equivalences in `(11)`.

A triply linked tree contains, for each node $x$, three pointers: $PARENT(x)$ to the parent of $x$, $LCHILD(x)$ to the leftmost child of $x$, and $RLINK(x)$ to the next sibling of $x$.

Let the nodes be linked initially by the arbitrary linear list \text{FIRST} \to x_1 \to x_2 \to \cdots \to x_n \to \Lambda, through their present `RLINK` fields.

Let the original forest contain $n$ nodes, of which $m$ are terminal.

Algorithm `2.

Yes.

We are asked: > If we had only `LTAG`, `INFO`, and `RTAG` fields (not `LLINK`) in a level-order sequential representation like (8), would it be possible to reconstruct the `LLINK`s?

We are asked to design an algorithm analogous to Algorithm `F` for the _preorder with degrees_ representation of a forest, traversing from **right to left**.

[Section 2.

Let the nodes be numbered $1,2,\ldots,n$ in their location order.

For every pair of subformulas $(A,B)$ occurring in $X$ and $Y$, define a Boolean value T(A,B).

Represent every expression by a tree whose internal nodes are only the operators `$+$`, `$\times$`, and `$\ln$`.

Let $F$ be a forest and let $u, v$ be nodes in $F$.

Exercise 14 asks for the running time of the `COPY` subroutine of Exercise 13.

The routine `DIV` computes the derivative of a formula of the form $u / v$ with respect to the variable $x$, according to rule `(18)`: D(u/v) = D(u)/v - (u \times D(v))/(v \uparrow 2).

[Section 2.

Exercise `12` specifies `DIFF[8]` for exponentiation, corresponding to rule `(19)`: D(u \uparrow v) = D(u) \times \bigl(v \times (u \uparrow (v - 1))\bigr) + \bigl((\ln u) \times D(v)\bigr)\times(u \u...

We are asked to draw trees analogous to those in `(7)` corresponding to the formula y = e^{-x^2}.

[Section 2.

Let $F$ and $F'$ be forests whose nodes in preorder are $u_1, u_2, \dots, u_n$ and $u'_1, u'_2, \dots, u'_{n'}$, respectively.

Let us reformulate the ordering of Exercise `2.

Let $T$ be a nonempty binary tree in which every node has either $0$ or $2$ children.

Let $F$ be a forest containing $t$ trees.

Let the partial order on the nodes of a forest be defined by u < v whenever $v$ is a descendant of $u$.

Let the Dewey decimal notation of a node be d_1.

[Section 2.

We are asked to determine whether the statement > "The terminal nodes of a tree occur in the same relative position in preorder and postorder.

Let $(S, \prec)$ be a well-ordered set.

Let a binary tree have $n$ nodes.

Let $B$ be a binary tree.

Let a forest $F = (T_1, T_2, \dots, T_n)$ be given, with nodes numbered in Dewey decimal notation as in Section 2.

Let the right-threaded binary trees use the conventions of the section: - `LLINK(P)` is either a left child or `\Lambda`.

Let `X` be the new node to insert, and `T` be a pointer to the root of the tree.

The fundamental concepts of traversal extend immediately.

Let `T` be an unthreaded binary tree, represented in the standard form of (2), and let `P` be a pointer to a node of `T`.

Exercise 31 refers to Algorithm `I` for insertion into a right-threaded binary tree.

Algorithm `C` is intended to construct a new binary tree whose nodes contain the same information as the original tree and whose link structure is identical, regardless of whether a field represents a...

Let `T` be the pointer to the right-threaded binary tree, and let `AVAIL` be the head of the list of available nodes.

[Section 2.

Let $D(T)$ denote the double-order sequence of a binary tree $T$, as defined in exercise 18.

[Section 2.

We first interpret the definition of $\preceq$ as a recursive lexicographic comparison of trees: the empty tree precedes every tree; among nonempty trees, the roots are compared first; if the roots ag...

A _right-threaded_ binary tree contains ordinary left links and either ordinary right links or right threads.

We are asked to write a MIX program that implements the algorithm of Exercise 21, which traverses an unthreaded binary tree in inorder _without using any auxiliary stack_, modifying the `LLINK` and `R...

No.

We employ the _threading during traversal_ method, also known as the _Morris traversal_, which creates temporary links to predecessors during the traversal to avoid using a stack.

The preorder successor is characterized as follows.

Algorithm `T` uses an auxiliary stack `A` in consecutive memory locations.

Let a node $P$ of a threaded binary tree be given.

Let `P` point to a node of a binary tree, and consider `Q = P*`, the successor of `NODE(P)` in preorder.

We are asked to give an algorithm analogous to Algorithm `S` that determines the preorder successor `P*` of a node `P` in a threaded binary tree with a list head as in `(8), (9), (10)`.

The double-order traversal visits each node twice.

A postorder traversal must process a node only after both of its subtrees have been traversed.

We aim to construct an algorithm analogous to Algorithm `T` that traverses a binary tree in _preorder_, visiting each node exactly once, and then prove its correctness by induction on the number of no...

Let $B_n$ denote the number of binary trees with $n$ nodes.

In the representation (2), each node contains exactly two links, `LLINK` and `RLINK`.

The stack grows only in step `T3`, where the current value of `P` is pushed onto `A` and then `P` is replaced by `LLINK(P)`.

Let a binary tree with `n` nodes be traversed using Algorithm `T`.

Let the nodes of a binary tree be distinct.

Let the preorder of the binary tree be $u_1 u_2 \dots u_n$ and the inorder be $v_1 v_2 \dots v_n$.

Let a binary tree have $n$ nodes, with preorder sequence u_1 u_2 \dots u_n and inorder sequence

Let the representation of a node be the binary string $\alpha$, where the root is represented by `"1"`, the left child of $\alpha$ is $\alpha0$, and the right child is $\alpha1$.

Let `T` denote the root of the binary tree in the figure.

[Section 2.

Let us define the new traversal order recursively, as in the exercise: 1.

The statement claims that "The terminal nodes of a binary tree occur in the same relative position in preorder, inorder, and postorder.

[Section 2.

[Section 2.

[Section 2.

[Section 2.

[Section 2.

[Section 2.

[Section 2.