CS 173 Tree Stats

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/7

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

8 Terms

1
New cards

Number of nodes in a full m-ary tree with i internal nodes

mi + 1

2
New cards

Number of leaves in a full m-ary tree with i internal nodes

i(m - 1) + 1

3
New cards

Number of leaves in a full, complete m-ary tree

m^h

4
New cards

Number of nodes in a binary tree of height h

between h + 1 and 2^(h + 1) - 1

5
New cards

Number of leaves in a binary tree of height h

between 1 and 2^h

6
New cards

Number of nodes in a full binary tree with n internal nodes

2n + 1

7
New cards

Number of leaves in a full binary tree with n internal nodes

n + 1

8
New cards

Height of a full, complete binary tree with n nodes or leaves

approximately log(n)