Question

Proving if $G$ has no cycles but by adding one edge between any two vertices will create a cycle then $G$ is a tree

score 3.6k · Answer 1 · 2015-01-24 21:49:36

3.6k

Views

Proving if $G$ has no cycles but by adding one edge between any two vertices will create a cycle then $G$ is a tree

Published on 24 Jan 2015 - 21:49

score 659 · Answer 2 · 2015-01-24 22:56:45

659

Views

Rotations after inserting element in AVL-tree

Published on 24 Jan 2015 - 22:56

score 2.2k · Answer 3 · 2015-01-25 19:13:10

2.2k

Views

Discrete math - Prove that a tree with n nodes must have exactly n - 1 edges?

Published on 25 Jan 2015 - 19:13

score 158 · Answer 4 · 2015-01-25 22:47:47

158

Views

Is these Trees isomorphic or not?

Published on 25 Jan 2015 - 22:47

score 90 · Answer 5 · 2015-01-26 22:39:39

90

Views

Determine if there is a node in a binary postorder anti-sorted tree with key $k$

Published on 26 Jan 2015 - 22:39

score 279 · Answer 6 · 2015-01-27 03:10:36

279

Views

Identifying Binary Search Trees from their Prufer Sequence

Published on 27 Jan 2015 - 3:10

score 11.8k · Answer 7 · 2015-01-31 22:38:13

11.8k

Views

Induction Proof Check: For a binary tree T, Prove that the number of full nodes in T is always one less than the number of leaves in T.

Published on 31 Jan 2015 - 22:38

score 89 · Answer 8 · 2015-02-02 23:10:37

89

Views

Binary search tree. Counting.

Published on 02 Feb 2015 - 23:10

score 896 · Answer 9 · 2015-02-03 17:12:23

896

Views

Exponential Generating Function of rooted minimal directed acyclic graphs

Published on 03 Feb 2015 - 17:12

score 93 · Answer 10 · 2026-03-27 18:38:12

93

Views

Examples of forcings which add no "definable" Aronjain tree

Published on 27 Mar 2026 - 18:38

score 940 · Answer 11 · 2026-03-30 02:04:59

940

Views

Huffman coding - conditions for perfect tree output

Published on 30 Mar 2026 - 2:04

score 1.7k · Answer 12 · 2026-03-28 16:44:15

1.7k

Views

Prove by induction that every complete $k$-ary tree of depth $n$ has $(k^{n+1}–1)/(k-1)$ nodes for all integers $n\ge 0$, where $k\ge 2$.

Published on 28 Mar 2026 - 16:44

score 851 · Answer 13 · 2015-02-08 05:40:11

851

Views

Counting unlabeled and non-uniquely labeled trees

Published on 08 Feb 2015 - 5:40

score 46.8k · Answer 14 · 2015-02-09 13:30:42

46.8k

Views

In binary tree, number of nodes with two children when number of leaves is given

Published on 09 Feb 2015 - 13:30

score 1.9k · Answer 15 · 2015-02-10 10:27:06

1.9k

Views

In a Tree, show that the largest degree of a node <= number of nodes of degree 1

Published on 10 Feb 2015 - 10:27

List Question

Proving if $G$ has no cycles but by adding one edge between any two vertices will create a cycle then $G$ is a tree

Rotations after inserting element in AVL-tree

Discrete math - Prove that a tree with n nodes must have exactly n - 1 edges?

Is these Trees isomorphic or not?

Determine if there is a node in a binary postorder anti-sorted tree with key $k$

Identifying Binary Search Trees from their Prufer Sequence

Induction Proof Check: For a binary tree T, Prove that the number of full nodes in T is always one less than the number of leaves in T.

Binary search tree. Counting.

Exponential Generating Function of rooted minimal directed acyclic graphs

Examples of forcings which add no "definable" Aronjain tree

Huffman coding - conditions for perfect tree output

Prove by induction that every complete $k$-ary tree of depth $n$ has $(k^{n+1}–1)/(k-1)$ nodes for all integers $n\ge 0$, where $k\ge 2$.

Counting unlabeled and non-uniquely labeled trees

In binary tree, number of nodes with two children when number of leaves is given

In a Tree, show that the largest degree of a node <= number of nodes of degree 1

Trending Questions

Popular # Hahtags

Popular Questions