Hexo

Home Archives
2018-05-11
Leetcode

Tree Traversals (Inorder, Preorder and Postorder)

Object: Binary Tree

tree12

Depth First Traversals:

(a) Inorder (Left, Root, Right) : 4 2 5 1 3

(b) Preorder (Root, Left, Right) : 1 2 4 5 3

(c) Postorder (Left, Right, Root) : 4 5 2 3 1

Share
Newer
python程序运行时间
Older
String Manipulation

Categories

  • Hexo
  • Java
  • Leetcode
  • Python
  • Shell Command
  • Uncategorized
  • Web
    • Back-end
      • Django
    • Front-end
  • python

Tags

  • Bit Manipulation
  • Git
  • Set

Tag Cloud

Bit Manipulation Git Set

Archives

  • September 2018
  • July 2018
  • June 2018
  • May 2018
  • April 2018

Recent Posts

  • Leetcode 经验
  • Establish a django project
  • Set Max and Min in Python
  • Build a html page
  • HTML Basics
© 2018 John Doe
Powered by Hexo
Home Archives