Data Structure - Binary Tree

1. Binary Trees

3. Picture of a binary tree a b c d e g h i l f j k

17. Depth-First Search A B C D E F G A B D E C F G Stack: Current:

18. Depth-First Search A B C D E F G Undiscovered Marked Finished Active B newly discovered Stack: (A, C); (A, B) Current:

19. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active A already marked Visited B Stack: (B, E); (B, D); (B, A) (A, C); (A, B)

20. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active A already marked Visited B A Stack: (B, E); (B, D); (B, A) (A, C); (A, B)

21. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active D newly discovered A Stack: (B, E); (B, D); (B, A) (A, C); (A, B)

22. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Visited D A B Stack: (B, E); (B, D); (B, A) (A, C); (A, B) (B, D) Marked B

23. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Finished D A B Stack: (B, E); (B, D); (B, A) (A, C); (A, B)

24. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active E newly discovered Stack: (B, E); (B, D); (B, A) (A, C); (A, B) A B D Backtrack B

25. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Visited E Stack: (B, E); (B, D); (B, A) (A, C); (A, B) A B D (B, E)

26. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Finished E Stack: (B, E); (B, D); (B, A) (A, C); (A, B) A B D

27. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (B, E); (B, D); (B, A) (A, C); (A, B) A B D E

28. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (A, C); (A, B) A B D E Backtrack B

29. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (A, C); (A, B) A B D E Backtrack A Finished B C newly discovered

30. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) A B D E Visited C (A, C); (A, B)

31. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) Marked C (A, C); (A, B) F newly discovered A B D E C

32. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) (A, C); (A, B) Visited F A B D E C (F, C)

33. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) (A, C); (A, B) Finished F A B D E C

34. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) (A, C); (A, B) Backtrack C G newly discovered A B D E C F

35. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) (A, C); (A, B) Marked C Visited G A B D E C F (G, C)

36. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (C, G); (C, F); (C, A) (A, C); (A, B) Backtrack C Finished G A B D E C F G

37. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: (A, C); (A, B) Finished C A B D E C F G Backtrack A

38. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active Stack: A B D E C F G Finished A

39. Depth-First Search A B C D E F G Current: Undiscovered Marked Finished Active A B D E C F G

42. Breadth-First Search A B C D E F G A B C D E F G Queue: Current:

43. Breadth-First Search A B C D E F G Queue: Current: A

44. Breadth-First Search A B C D E F G Queue: Current: A A

45. Breadth-First Search A B C D E F G Queue: Current: A A

46. Breadth-First Search A B C D E F G Queue: Current: B A A

47. Breadth-First Search A B C D E F G Queue: Current: C B A A

48. Breadth-First Search A B C D E F G Queue: Current: B A C B

49. Breadth-First Search A B C D E F G Queue: Current: B C A B

50. Breadth-First Search A B C D E F G Queue: Current: D C B A B

51. Breadth-First Search A B C D E F G Queue: Current: E D C B A B

52. Breadth-First Search A B C D E F G Queue: Current: C E D C A B

53. Breadth-First Search A B C D E F G Queue: Current: C A B C E D

54. Breadth-First Search A B C D E F G Queue: Current: C A B C F E D

55. Breadth-First Search A B C D E F G Queue: Current: C A B C G F E D

56. Breadth-First Search A B C D E F G Queue: Current: D A B C G F E D

57. Breadth-First Search A B C D A B C D E F G Queue: Current: D G F E

58. Breadth-First Search A B C D E F G A B C D Queue: Current: E G F E

59. Breadth-First Search A B C D E F G Queue: Current: F G A B C D E F

60. Breadth-First Search A B C D E F G Queue: Current: G G A B C D E F

61. Breadth-First Search A B C D E F G Queue: Current: G A B C D E F G

62. Breadth-First Search A B C D E F G A B C D E F G

69. Thank you for listening!