Practice Counting Valid Paths (23.2.1) - Full Binary Tree Definition - Discrete Mathematics

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a full binary tree?
Show hintHide hint
Think about how many children each node should have.
Question 2.
How do you calculate the number of diagonals in a triangle?
Show hintHide hint
Consider what diagonal connects non-adjacent vertices.
3Question 3.
What characterizes a full binary tree?
- Each node has either one or two children.
- Each node has two or no children.
- Nodes can have three children.
Show hintHide hint
Consider what makes a tree 'full'.
4Question 4.
A valid path in a grid can involve which moves?
- True
- False
Show hintHide hint
Think about the movement constraints.
Question 5.
How many distinct full binary trees can you create with 5 leaves? Hint: Relate to Catalan numbers.
Show hintHide hint
Remember to look up the Catalan number for n = 4.
Question 6.
If there are 10 sides in a convex polygon, how many diagonals exist?
Show hintHide hint
Calculate each step carefully and remember the formula!

4 more questions in this section. Enroll free to practise them all.