Question

Why do the children of a node $n$ in a complete binary tree have indices $2n $ and $2n+1$?

score 1.2k · Answer 1 · 2014-03-27 05:01:33

1.2k

Views

Why do the children of a node $n$ in a complete binary tree have indices $2n $ and $2n+1$?

Published on 27 Mar 2014 - 5:01

score 19.1k · Answer 2 · 2014-03-30 17:20:24

19.1k

Views

A tree has at least two leaves (proof by contradiction)

Published on 30 Mar 2014 - 17:20

score 4.2k · Answer 3 · 2014-04-02 02:56:01

4.2k

Views

Definition of a leaf in a tree

Published on 02 Apr 2014 - 2:56

score 2k · Answer 4 · 2014-04-02 06:45:24

2k

Views

Proving that a sub-graph of a tree is a tree

Published on 02 Apr 2014 - 6:45

score 4k · Answer 5 · 2014-04-05 10:26:45

4k

Views

How many trees are in the spanning forest of a graph?

Published on 05 Apr 2014 - 10:26

score 4.8k · Answer 6 · 2014-04-07 05:21:51

4.8k

Views

What is the difference between a forest and a spanning forest?

Published on 07 Apr 2014 - 5:21

score 669 · Answer 7 · 2014-04-07 09:53:21

669

Views

How do I construct a minimum spanning forest?

Published on 07 Apr 2014 - 9:53

score 198 · Answer 8 · 2014-04-14 13:30:12

198

Views

Proving this tree definition with pigeonhole principle

Published on 14 Apr 2014 - 13:30

score 285 · Answer 9 · 2014-04-15 13:47:07

285

Views

Finite trees and embedding in infinite regular trees.

Published on 15 Apr 2014 - 13:47

score 8.2k · Answer 10 · 2014-04-17 02:00:08

8.2k

Views

Determining the total degree of a tree

Published on 17 Apr 2014 - 2:00

score 213 · Answer 11 · 2026-03-26 06:25:49

213

Views

Expected number of feed-forward/backward triangles in a random graph with internal nodes.

Published on 26 Mar 2026 - 6:25

score 3.1k · Answer 12 · 2014-04-20 12:13:48

3.1k

Views

Number of all labeled, unordered rooted trees with $n$ vertices and $k$ leaves.

Published on 20 Apr 2014 - 12:13

score 106 · Answer 13 · 2014-04-23 07:42:37

106

Views

calculate the proportion of n-node trees whose root has only one or two subtrees.

Published on 23 Apr 2014 - 7:42

score 138 · Answer 14 · 2026-03-25 16:14:04

138

Views

Can we construct from $[0,\omega_1)$ a space which is strictly-Frechet with no winning strategy in $G_{np}(q,E)$?

Published on 25 Mar 2026 - 16:14

score 1.1k · Answer 15 · 2014-04-23 14:39:10

1.1k

Views

Determine number of directed trees and rooted trees obtainable

Published on 23 Apr 2014 - 14:39

List Question

Why do the children of a node $n$ in a complete binary tree have indices $2n $ and $2n+1$?

A tree has at least two leaves (proof by contradiction)

Definition of a leaf in a tree

Proving that a sub-graph of a tree is a tree

How many trees are in the spanning forest of a graph?

What is the difference between a forest and a spanning forest?

How do I construct a minimum spanning forest?

Proving this tree definition with pigeonhole principle

Finite trees and embedding in infinite regular trees.

Determining the total degree of a tree

Expected number of feed-forward/backward triangles in a random graph with internal nodes.

Number of all labeled, unordered rooted trees with $n$ vertices and $k$ leaves.

calculate the proportion of n-node trees whose root has only one or two subtrees.

Can we construct from $[0,\omega_1)$ a space which is strictly-Frechet with no winning strategy in $G_{np}(q,E)$?

Determine number of directed trees and rooted trees obtainable

Trending Questions

Popular # Hahtags

Popular Questions