Ciro Santilli OurBigBook.com $£ Sponsor €¥ 中国独裁统治 China Dictatorship 新疆改造中心、六四事件、法轮功、郝海东、709大抓捕、2015巴拿马文件 邓家贵、低端人口、西藏骚乱
This is the order in which a binary search tree should be traversed for ordered output, i.e.:
  • everything to the left is smaller than parent
  • everything to the right is larger than parent
This ordering makes sense for binary trees and not k-ary trees in general because if there are more than two nodes it is not clear what the top node should go in the middle of.
This is unlike pre-order depth-first search and post-order depth-first search which generalize obviously to general trees.

Ancestors

  1. Depth-first search
  2. Tree traversal
  3. Tree
  4. Type of graph
  5. Graph
  6. Discrete mathematics
  7. Area of mathematics
  8. Mathematics
  9. Ciro Santilli's Homepage

Synonyms