You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Sep 20, 2024. It is now read-only.
Copy file name to clipboardexpand all lines: README.md
+6-10
Original file line number
Diff line number
Diff line change
@@ -16,21 +16,13 @@ List Items 1
16
16
* Harry
17
17
* Professor
18
18
* Dobby
19
-
*List Items 2
19
+
List Items 2
20
20
* The House Elf
21
21
* Potter
22
22
* Granger
23
23
* Lockhart
24
24
* Weasley
25
25
26
-
List Items 2
27
-
* Potter
28
-
* Fred
29
-
* Greg
30
-
* George
31
-
* Voldemort
32
-
* Sirius
33
-
* Dumbledore
34
26
35
27
## Set 2
36
28
@@ -46,4 +38,8 @@ Find the product abc.
46
38
6. Print all the prime numbers between 1 and 99999
47
39
48
40
7. Ask the user for a string and print out whether this string is a palindrome or not.
49
-
A palindrome is a string that reads the same forwards and backwards.
41
+
A palindrome is a string that reads the same forwards and backwards.
42
+
43
+
## Set 3
44
+
45
+
8. Create a binary tree class. Overload the ‘+’ operator to behave as an node insertion, ‘-‘ operator to behave as a node deletion. This should be strictly written in Python.
0 commit comments