In today’s session following topic covered:
Inorder
left → root → right
Preorder
root → left → right
post order
left → right–> root
Graphs : vertex(nodes) & corner(edges)
BSF (breath first search) level order traversal
DSF (depth first search)
binary
left node < root node
right node >= root node
2 Likes
@sms18680
Thank you for sharing.
2 Likes