Question

Does geeksforgeeks website has an error regarding maximum number of nodes in a tree?

score 52 · Answer 1 · 2026-03-25 13:05:06

52

Views

Does geeksforgeeks website has an error regarding maximum number of nodes in a tree?

Published on 25 Mar 2026 - 13:05

score 121 · Answer 2 · 2026-03-25 20:08:06

121

Views

A tree with a lexicographic order is a linear ordered structure

Published on 25 Mar 2026 - 20:08

score 81 · Answer 3 · 2026-03-29 19:10:06

81

Views

Generalization of Bass-Serre Theory for pro-trees, $\Lambda$-trees, and $\mathbb R$-trees

Published on 29 Mar 2026 - 19:10

score 54 · Answer 4 · 2026-03-30 11:57:46

54

Views

Does every 3-valent planar graph admit a maximal tree, which is non-branching?

Published on 30 Mar 2026 - 11:57

score 25 · Answer 5 · 2022-07-15 11:50:46

25

Views

Sum of leaf probabilities on ternary tree

Published on 15 Jul 2022 - 11:50

score 112 · Answer 6 · 2022-07-15 14:06:45

112

Views

Math Formula for a Recursive Relation of any K-Ary Tree

Published on 15 Jul 2022 - 14:06

score 93 · Answer 7 · 2026-03-25 07:48:46

93

Views

Constructing $K_4$ as a quotient of the Bruhat-Tits tree

Published on 25 Mar 2026 - 7:48

score 37 · Answer 8 · 2022-07-16 22:14:43

37

Views

Counting spanning trees that satisfy a condition.

Published on 16 Jul 2022 - 22:14

score 155 · Answer 9 · 2022-07-18 13:11:33

155

Views

removing and adding one edge results in a new spanning tree

Published on 18 Jul 2022 - 13:11

score 53 · Answer 10 · 2022-07-19 10:13:17

53

Views

shortest path MST

Published on 19 Jul 2022 - 10:13

score 103 · Answer 11 · 2022-07-19 10:13:53

103

Views

Prove that the number degree $3$ vertices is less than half of the total number of vertices in a tree.

Published on 19 Jul 2022 - 10:13

score 105 · Answer 12 · 2022-07-19 21:14:24

105

Views

G-F is disconnected $\Leftrightarrow$ for each spanning tree $T=(V,E_T)$ of $G$ we have $F\cap E_T\neq \emptyset$.

Published on 19 Jul 2022 - 21:14

score 173 · Answer 13 · 2022-07-23 20:00:34

173

Views

For two minimum spanning trees $T_1,T_2$, $\{c(e):e\in T_1\}=\{c(e): e\in T_2\}$

Published on 23 Jul 2022 - 20:00

score 66 · Answer 14 · 2026-03-31 19:11:43

66

Views

Cut non-binary tree into sub-trees of maximum depth

Published on 31 Mar 2026 - 19:11

score 85 · Answer 15 · 2022-08-06 18:47:28

85

Views

If we construct a tree of all paths leading out of some root node, is that tree necessarily unique?

Published on 06 Aug 2022 - 18:47

List Question

Does geeksforgeeks website has an error regarding maximum number of nodes in a tree?

A tree with a lexicographic order is a linear ordered structure

Generalization of Bass-Serre Theory for pro-trees, $\Lambda$-trees, and $\mathbb R$-trees

Does every 3-valent planar graph admit a maximal tree, which is non-branching?

Sum of leaf probabilities on ternary tree

Math Formula for a Recursive Relation of any K-Ary Tree

Constructing $K_4$ as a quotient of the Bruhat-Tits tree

Counting spanning trees that satisfy a condition.

removing and adding one edge results in a new spanning tree

shortest path MST

Prove that the number degree $3$ vertices is less than half of the total number of vertices in a tree.

G-F is disconnected $\Leftrightarrow$ for each spanning tree $T=(V,E_T)$ of $G$ we have $F\cap E_T\neq \emptyset$.

For two minimum spanning trees $T_1,T_2$, $\{c(e):e\in T_1\}=\{c(e): e\in T_2\}$

Cut non-binary tree into sub-trees of maximum depth

If we construct a tree of all paths leading out of some root node, is that tree necessarily unique?

Trending Questions

Popular # Hahtags

Popular Questions