Description: Assuming top-down by the level of input from left to right each node of a triple (N, P, L/R). One N-based node elements, P node for his father, L instructions N to P s left child, R instructions N to P s right child. Written test to establish a binary tree in memory of the double-stranded said algorithm, and the achievement of the first root, root, root, as well as sequence traversal algorithm.
To Search:
- [Add] - Polynomials adder table with links to th
- [Graph] - The realization of the use of adjacency
- [erchashu] - 1. Recursive preorder traversal 2. Recur
File list (Check if you may need any files):
Download