Skip to content
This repository was archived by the owner on Sep 20, 2024. It is now read-only.

Commit c802f1d

Browse files
committed
Bonus Question
1 parent e3039eb commit c802f1d

File tree

1 file changed

+6
-10
lines changed

1 file changed

+6
-10
lines changed

README.md

+6-10
Original file line numberDiff line numberDiff line change
@@ -16,21 +16,13 @@ List Items 1
1616
* Harry
1717
* Professor
1818
* Dobby
19-
* List Items 2
19+
List Items 2
2020
* The House Elf
2121
* Potter
2222
* Granger
2323
* Lockhart
2424
* Weasley
2525

26-
List Items 2
27-
* Potter
28-
* Fred
29-
* Greg
30-
* George
31-
* Voldemort
32-
* Sirius
33-
* Dumbledore
3426

3527
## Set 2
3628

@@ -46,4 +38,8 @@ Find the product abc.
4638
6. Print all the prime numbers between 1 and 99999
4739

4840
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

Comments
 (0)