Example Binary Tree Traversals - Preorder, Inorder, Postorder, & Level Order

Поделиться
HTML-код
  • Опубликовано: 2 фев 2025

Комментарии • 7

  • @JustinQLe
    @JustinQLe 4 месяца назад +12

    Wouldn't for In-order the right subtree pattern would be I, F, J, C, G, K and not C, I, F, J, G, K like you stated. Since in the inorder you visit the left most child of the subtree before visiting the root node of that subtree.

  • @shahinkohzadpour
    @shahinkohzadpour Месяц назад

    thanks!
    it was helpful!

  • @hockeyfan1233
    @hockeyfan1233 5 месяцев назад +1

    thanks for the helpful video!

  • @jessicazumbach3672
    @jessicazumbach3672 Месяц назад +2

    Hi, I noticed an error in the in-order traversal sequence; it should be D B H E A I F J C G K. Please take the time to review your videos thoroughly before posting them. Providing incorrect information can make it challenging for college students to trust the material and grasp the concept effectively. Thank you!

    • @ELLA-oj1rm
      @ELLA-oj1rm Месяц назад

      I was confused about this. Thanks for your comment !