Question

How to find the number of all the possible ordered trees with n edges and k leaves?

score 2.6k · Answer 1 · 2015-07-25 21:36:41

2.6k

Views

How to find the number of all the possible ordered trees with n edges and k leaves?

Published on 25 Jul 2015 - 21:36

score 1.1k · Answer 2 · 2015-07-29 05:23:55

1.1k

Views

A tree has a root, leaves, and what?

Published on 29 Jul 2015 - 5:23

score 804 · Answer 3 · 2015-07-31 16:33:42

804

Views

Generating all coprime pairs

Published on 31 Jul 2015 - 16:33

score 94 · Answer 4 · 2026-03-27 16:09:16

94

Views

$ G=(V,E_1 \cup E_2) $ is a triangle free graph, where $ G_1=(V,E_1) $ is planar and $ G_2 = (V, E_2)$ is a tree. Prove that: $ \chi (G) < 7 $

Published on 27 Mar 2026 - 16:09

score 325 · Answer 5 · 2015-08-05 16:22:32

325

Views

Binary tree node value by level

Published on 05 Aug 2015 - 16:22

score 4.6k · Answer 6 · 2015-08-08 06:44:36

4.6k

Views

Number of binary search trees on $n$ nodes of height up to $h$

Published on 08 Aug 2015 - 6:44

score 222 · Answer 7 · 2015-08-09 03:24:37

222

Views

Completeness in M-ary trees where the value of M is variable.

Published on 09 Aug 2015 - 3:24

score 308 · Answer 8 · 2026-03-29 07:29:06

308

Views

Sum of roots of binary search trees of height $\le H$ with $N$ nodes

Published on 29 Mar 2026 - 7:29

score 71 · Answer 9 · 2026-03-27 23:13:01

71

Views

Dijkstra's algorithm, am I or the teacher mistaken?

Published on 27 Mar 2026 - 23:13

score 220 · Answer 10 · 2026-03-27 04:14:58

220

Views

Dijkstra’s algorithm / path is this done correctly?

Published on 27 Mar 2026 - 4:14

score 441 · Answer 11 · 2015-08-31 09:45:28

441

Views

Number of spanning trees in a complete split graph

Published on 31 Aug 2015 - 9:45

score 665 · Answer 12 · 2015-09-01 17:28:27

665

Views

Find a recursive definition for inorder: binary Tree(T) → list(T ) where inorder(T ) is the list of nodes from an inorder traversal of T .

Published on 01 Sep 2015 - 17:28

score 97 · Answer 13 · 2015-09-09 11:38:24

97

Views

Probability tree diagrams

Published on 09 Sep 2015 - 11:38

score 810 · Answer 14 · 2015-09-14 13:03:30

810

Views

Construction of rooted tree , please check whether my solution is correct?

Published on 14 Sep 2015 - 13:03

score 60 · Answer 15 · 2026-03-27 17:05:12

60

Views

Defining a Nested Tree (set-theoretic)

Published on 27 Mar 2026 - 17:05

List Question

How to find the number of all the possible ordered trees with n edges and k leaves?

A tree has a root, leaves, and what?

Generating all coprime pairs

$ G=(V,E_1 \cup E_2) $ is a triangle free graph, where $ G_1=(V,E_1) $ is planar and $ G_2 = (V, E_2)$ is a tree. Prove that: $ \chi (G) < 7 $

Binary tree node value by level

Number of binary search trees on $n$ nodes of height up to $h$

Completeness in M-ary trees where the value of M is variable.

Sum of roots of binary search trees of height $\le H$ with $N$ nodes

Dijkstra's algorithm, am I or the teacher mistaken?

Dijkstra’s algorithm / path is this done correctly?

Number of spanning trees in a complete split graph

Find a recursive definition for inorder: binary Tree(T) → list(T ) where inorder(T ) is the list of nodes from an inorder traversal of T .

Probability tree diagrams

Construction of rooted tree , please check whether my solution is correct?

Defining a Nested Tree (set-theoretic)

Trending Questions

Popular # Hahtags

Popular Questions