mirror of https://github.com/01-edu/public.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
117 lines
2.0 KiB
117 lines
2.0 KiB
5 years ago
|
## Same Tree
|
||
|
|
||
|
## **WARNING! VERY IMPORTANT!**
|
||
|
|
||
|
For this exercise a function will be tested **with the exam own main**. However the student **still needs** to submit a structured program:
|
||
|
|
||
|
This means that:
|
||
|
|
||
|
- The package needs to be named `package main`.
|
||
|
- The submitted code needs one declared function main(```func main()```) even if empty.
|
||
|
- The function main declared needs to **also pass** the `Restrictions Checker`(illegal functions tester). It is advised for the student to just empty the function main after its own testings are done.
|
||
|
- Every other rules are obviously the same than for a `program`.
|
||
|
|
||
|
|
||
|
### Instructions
|
||
|
|
||
|
Given two binary trees, write a function to check if they are the same or not.
|
||
|
|
||
|
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
|
||
|
|
||
|
Write a function, `IsSameTree`, that returns bool.
|
||
|
|
||
|
|
||
|
|
||
|
### Expected function
|
||
|
|
||
|
```go
|
||
|
type TreeNodeL struct {
|
||
|
Left *TreeNodeL
|
||
|
Val int
|
||
|
Right *TreeNodeL
|
||
|
}
|
||
|
|
||
|
|
||
|
func IsSameTree(p *TreeNodeL, q *TreeNodeL) bool {
|
||
|
}
|
||
|
```
|
||
|
Example 1:
|
||
|
|
||
|
Input:
|
||
|
|
||
|
1
|
||
|
/ \
|
||
|
2 3
|
||
|
|
||
|
[1,2,3]
|
||
|
|
||
|
1
|
||
|
/ \
|
||
|
2 3
|
||
|
|
||
|
[1,2,3]
|
||
|
|
||
|
Output: true
|
||
|
|
||
|
Input:
|
||
|
|
||
|
1
|
||
|
/
|
||
|
2
|
||
|
|
||
|
[1,2],
|
||
|
|
||
|
1
|
||
|
\
|
||
|
2
|
||
|
|
||
|
[1,null,2]
|
||
|
|
||
|
Output: false
|
||
|
|
||
|
Input:
|
||
|
|
||
|
1
|
||
|
/ \
|
||
|
2 1
|
||
|
|
||
|
[1,2,1],
|
||
|
|
||
|
1
|
||
|
/ \
|
||
|
1 2
|
||
|
|
||
|
[1,1,2]
|
||
|
|
||
|
Output: false
|
||
|
|
||
|
### Usage
|
||
|
|
||
|
Here is a possible program to test your function :
|
||
|
|
||
|
```go
|
||
|
package main
|
||
|
|
||
|
import (
|
||
|
piscine ".."
|
||
|
)
|
||
|
|
||
|
func main() {
|
||
|
t1 := NewRandTree()
|
||
|
t2 := NewRandTree()
|
||
|
|
||
|
fmt.Println(IsSameTree(t1, t2))
|
||
|
}
|
||
|
```
|
||
|
|
||
|
|
||
|
### Output
|
||
|
|
||
|
|
||
|
```console
|
||
|
student@ubuntu:~/[[ROOT]]/test$ go build
|
||
|
student@ubuntu:~/[[ROOT]]/test$ ./test
|
||
|
true
|
||
|
student@ubuntu:~/[[ROOT]]/test$
|
||
|
```
|