Added: 1 year ago
From: learnwithtechies
Views: 13,583
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (18)

Sign In or Sign Up now to post a comment!
  • b tree deletion,anywhere?

  • Thank you :)

  • You should've just read it out

  • Comment removed

  • o common, you couldnt just read the script, you had to use that anooying computer voice. fuck you you stupid nigger

  • Gr8 concept.. Well presented!! Thanks for your effort!! Really appreciate it!!

  • the post-order traversal seems does not work when a subtree has more than three children. Any one have ideas???

  • @a334531939 If it has more than 2 children, then it is a binary tree, not a binary search tree. post order traversal only works with binary search trees.

  • THIS DOESNT WORK EVERYTIME !!....

  • I really like the way that you explained tree traversal as first, second, third time visiting the node. I had never heard it explained that way before.

  • very easy to understand the way it is presented and precise. - u r the man - ss

  • thnx

  • very intuitive :D

  • @kidburn202429, @bardas5

    Thx for the support. Tree-part3 will be out soon. Please subscribe to our Channel if you want to be updated. We will publish more tutorials on Data-Structures, C internal Programming and Operating Systems.

  • this is very good! I like the graphic presentation. Post more!

  • thanks, good tutorial !

  • thanks, good tutorial !

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more