|
Given a pre-order sequence from a binary tree traversal, how many unique trees can be constructed? Give the recurrence relation. Eg. given the pre-order traversal sequence 1, 2 you can create 2 unique trees: 2 3 This leads to the obvious base cases: T(0) = 1 T(1) = 1 T(2) = 2 what is T(N), where N is the number of elements in the sequence? |
Follow this question
By Email:Once you sign in you will be able to subscribe for any updates here
By RSS:Markdown Basics
- *italic* or _italic_
- **bold** or __bold__
- Indent code by 4 spaces.
- link:[text](http://url.com/ "Title")
- image?
- numbered list: 1. Foo 2. Bar
- to add a line break simply add two spaces to where you would like the new line to be.
- basic HTML tags are also supported
Tags:
Asked: 05 Aug, 18:59
Seen: 421 times
Last updated: 06 Aug, 08:32
Related questions
