I have the following question: Assume I have an infinite $p$-regular tree, that is a tree where every node has degree $p$ (so also the root should have degree $p$). Then how many subtrees containing ...

QUESTION:
This is literally the question:
Given i, then l = (m-1)i + 1, and n = mi + 1.
This is a corollary to the theorem that "Given an m-ary tree with n vertices, of which i vertices are internal. ...

1 the students estimate the height of a tree using a stick 10 feet high. One member of the team lies on the gound 240 feet away from the foot of the tree.He lines up the top of the tree with the top ...

Good day,
I have this exercice that provides me with the 16x16 matrix of adjacency of a graph and it asks me to find the number of connected components of the graph and I need to give a spanning tree ...

For any smal category $A$, I shall write $\widehat A$ for the category $[A^{\text op}, \mathbf{Set}]$ of presheaves on $A$, and $y_A\colon A \to \widehat A$ for the Yoneda embedding relative to $A$.
...

In a Rooted Tree, we have a message on Root. in each step, each node that has a one copy of message, can transfer this message to at most one of it's childeren. we want to use minimum step and send ...

Prove that if $T$ is a tree on at least $k+1$ vertices and max degree at most $d$, then there exists an edge $e$ such that the removal of $e$ causes $T$ to split into two trees where at least one of ...

For a binary tree what is the number of nodes with two children when the number of leaves is 20?
I know that for complete binary tree, when the number of leaves is x then the number of internal nodes ...

The question is: Given 4 characters and their frequencies, what's the max possible difference between the frequency of the rarest character and that of the most common character, so the output Huffman ...

Maybe a bit board question but:
Fixing a regular cardinal $\kappa$ in the ground model, I am looking for examples of set forcing notions which preserve regularity of $\kappa$ and add no new $\kappa$ ...

This is a slight variant on a very common beginner's problem. I think I've got it figured out, but I wanted to make sure I actually proved what's being asked.
We define a binary tree $T$:
(a) A tree ...

If you ignore its root, a Binary Search Tree generated by some permutation of $\{1, \ldots, n\}$ is a labeled tree. Which means you can calculate its Prufer Sequence. I did this in Python and I found ...

A binary postorder anti-sorted tree is a binary tree for which the post-order traversal gives the keys that are saved at the nodes of the tree in descending order. Present a pseudocode for the most ...

I'm new in discrete math. Can someone prove simply that a tree with $n$ nodes must have exactly $n - 1$ edges. I have researched the solution but I haven't founded yet. I know of course, a tree with n ...

We want to insert $58$ at the following AVL-tree and then we have to make rotations so that the tree is balanced. According to my notes, we are at the case RL (The first edge leads to the right and ...

Let us define a quasi-complete binary tree as a rooted binary whose nodes have all two children except at most those of the penultimate level, which can have either one or two children.
I read that ...

I want to write a function that takes as argument a pointer A to the root of a binary tree that simulates a (not necessarily binary) ordered tree.
We consider that each node of the tree saves apart ...

Given a binary search tree, it's easy to see that the inorder traversal returns values from the underlying set in order (according to the comparator that set up the binary search tree).
My question ...

The question is : Does there exist a tree with a vertex of degree k and less than k vertices of degree 1?
I tried a lot but it is impossible to find. There is no tree with a vertex degree k and less ...

I'm reading the paper "Efficient and Elegant Subword-Tree Construction"
by M.T. Chen and J.I. Seiferas
and I'm having trouble understanding their compact representation
to a Subword-tree, especially ...