Binary Tree Learning

1, before traversing the last three

  

For example the result of the binary tree traversal FIG.

    Preorder traversal: ABCDEFGHK

    Preorder: BDCAEHGKF

    Postorder: DCBHKGFEA

 

2, create a binary tree

(1) Create a list in order of binary preorder traversal of

abcd00e00f00ig00h00

int flag ,p;
p=0;

void Create(BiTree &T, char *s)
{
    p++;
    if (s[p] == '0')
        T = NULL;
    else
    {
        T = new Node;
        T->data = s[p];
        Create(T->left, s);
        Create(T->right, s);
    }

}

2, seeking depth, height, breadth, longest path