- Category:
- Data structs
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2012-12-01
- Downloads:
- 0 Times
- Uploaded by:
- 周杨
Description: 1, according to the root, the left subtree and the right subtree traversal three partTraverse the two fork tree sequence there are 6 possible:TLR ( or so ), TRL ( root of right and left )LTR ( left radical right ), RTL ( right to left )LRT ( or root ), RLT ( right left root )Among them, TRL, RTL and RLT three kinds of sequence in the left and right subtree are to the right subtree after left subtree, and the first leftDifferent habits, therefore, are often not used. The remaining three order of TLR, LTR and LRT respectively according to root access locationKnown as the first traversal, preorder and postorder traversal.( 1) the first traversalIf the two fork tree is empty, then the end of traversal operation otherwiseAccess to the root node Preorder left subtree Preorder right subtree.( 2) in the traversal binary tree is empty if two, then the end of traversal operation otherwiseTraversal of the left subtree Access to the root node Traversal of the right subtree.( 3) after the travers
To Search:
File list (Check if you may need any files):
Two forks tree problem\二叉树问题（自创）.txt
......................\问题描述.txt
Two forks tree problem
Download