1. 1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree.

2. 2 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi)

3. 3 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi)

4. 4 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at)

5. 5 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at)

6. 6 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at)

7. 7 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at)

8. 8 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do)

9. 9 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do)

10. 10 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) be inorder(null) inorder(be)

11. 11 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) be inorder(null) inorder(be)

12. 12 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) be inorder(null) inorder(be)

13. 13 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) be inorder(null) inorder(be)

14. 14 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do)

15. 15 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do)

16. 16 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do)

17. 17 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) go inorder(null) inorder(go)

18. 18 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) go inorder(null) inorder(go)

19. 19 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) go inorder(null) inorder(go)

20. 20 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do) inorder(null) go inorder(null) inorder(go)

21. 21 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at) inorder(be) do inorder(go) inorder(do)

22. 22 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(null) at inorder(do) inorder(at)

23. 23 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi)

24. 24 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi)

25. 25 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi)

26. 26 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no)

27. 27 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no)

28. 28 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if)

29. 29 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if)

30. 30 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if)

31. 31 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if)

32. 32 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if) inorder(null) me inorder(null) inorder(me)

33. 33 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if) inorder(null) me inorder(null) inorder(me)

34. 34 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if) inorder(null) me inorder(null) inorder(me)

35. 35 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if) inorder(null) me inorder(null) inorder(me)

36. 36 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(null) if inorder(me) inorder(if)

37. 37 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no)

38. 38 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no)

39. 39 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no)

40. 40 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi)

41. 41 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi)

42. 42 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) of inorder(null) inorder(of)

43. 43 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) of inorder(null) inorder(of)

44. 44 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) of inorder(null) inorder(of)

45. 45 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) of inorder(null) inorder(of)

46. 46 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi)

47. 47 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi)

48. 48 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi)

49. 49 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) we inorder(null) inorder(we)

50. 50 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) we inorder(null) inorder(we)

51. 51 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) we inorder(null) inorder(we)

52. 52 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi) inorder(null) we inorder(null) inorder(we)

53. 53 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no) inorder(of) pi inorder(we) inorder(pi)

54. 54 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi) inorder(if) no inorder(pi) inorder(no)

55. 55 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree. inorder(at) hi inorder(no) inorder(hi)

56. 56 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit the right subtree.