#Help study data structures

1 messages · Page 1 of 1 (latest)

uncut hemlock
#

Okay so I have a data structures exam tomorrow and I'm just gonna be going over some problems, ping if ya wanna go over them with me :D

dire wagon
#

gl candy!! I know next to nothing about data structures so if it helps you to teach me feel free to ping me 😂

uncut hemlock
#

omg bettt

#

are ya free?

#

let me teach you data structures

#

XD

keen root
uncut hemlock
#

yk what

#

let me send my problems

#

that I'll be going over

keen root
#

🫡.

uncut hemlock
# 
2. Implement the insertion and selection sort algorithms to arrange elements in the given
lists in ascending order.
3. Perform the following operations on a singly linked list:
a. Insert a node at the head of a linked list.
b. Insert a node at the tail of a linked list.
c. Insert node at a specific position of a linked list.
d. Insert node at appropriate position in a sorted linked list.
e. Delete node from a linked list based on position.
f. Delete node from a linked list based on value.
g. Print the elements of a linked list
h. Merge two sorted Linked Lists
4. Perform the following operations on a doubly linked list:
a. Insert a node at the head of a linked list.
b. Insert a node at the tail of a linked list.
c. Insert node at a specific position of a linked list.
d. Delete node from a linked list based on position.
e. Delete node from a linked list based on value.
f. Print the elements of a linked list
g. Reverse a Linked List
h. Delete duplicate nodes from a linked list.
5. Perform the following operations on a circular linked list:
a. Insert a node at the beginning of a linked list.
b. Insert a node at the end of a linked list.
c. Insert node at a specific position of a linked list.
d. Delete node from a linked list based on position.
e. Delete node from a linked list based on value.
f. Print the elements of a linked list
g. Print the size of linked list
6. Find the sum of two polynomials represented by using linked lists.
7. Check for Balanced Parentheses in the given infix expression using stack.
8. Convert the given infix expression to postfix form and evaluate it.
9. Implement dynamically linked Stack.
10. Implement dynamically linked Queue.
11. Implement Circular Queue.
# 
12. Implement BFS using a Queue.
13. Perform following operations on a BST:
a. Construct BST from given keys
b. Delete a given key from a BST.
c. Find the smallest/biggest Key in BST.
d. Implement following traversals: Preorder, Inorder, Postorder
14. Implement heap sort on a given list of keys
15. Implement DFS using a Stack.```
keen root
uncut hemlock
#

do ya wanna go over them together?

#

like in a bit

#

maybe 20 min?

keen root
keen root
uncut hemlock
#

alrrr

uncut hemlock
#

bro I feel eepy

#

I literally only slept for 1 hour in the past 38 hours

uncut hemlock
#

@keen root

keen root
#

ahann roger thatt, u should actually go for a nap then... 💀

uncut hemlock
#

nahh

#

in 1 hr maybe

#

sleep is for the weak baby

knotty plover
#

michelle has a whole book on DSA

#

if u scroll up far enough in #1170802256703135825 , you'll see the link there

uncut hemlock
#

lemme look rq

uncut hemlock
latent ledge
#

If you're doing data structures in java I have my pdf textbook from last semester

knotty plover
#

#📢︱all-announcements

#

LOL

#

here!

uncut hemlock
#

tyyy jeii

#

jei im broke

#

😭😭

knotty plover
#

i js texted michelle 😭

#

gonna ask to see if i can share it to u

uncut hemlock
#

sweoifhvwoiev

#

I love you, thank you

#

😭😭❤️

knotty plover
#

😭

latent ledge
uncut hemlock
#

I'm doing it in c

#

TT

latent ledge
#

found these online

uncut hemlock
#

🥺

#

you guys are the best omg

uncut hemlock
latent ledge
#

You’re welcome ❤️

uncut hemlock
#

Updateweeeee

#

I cookeddddd

uncut hemlock
# knotty plover 😭

Jei, did Mitchell reply btw? Exam is over for now but there's a theory exam in a week

latent ledge
uncut hemlock
#

:))

dire wagon
knotty plover