poo*_*ank 10 java algorithm tree traversal data-structures
在一次采访中,我获得了一个功能:
f(n)= square(f(n-1)) - square(f(n-2)); for n>2
f(1) = 1;
f(2) = 2;
Here n is the level of an n-array tree. f(n)=1,2,3,5,16...
Run Code Online (Sandbox Code Playgroud)
对于n给定N-Array的每个级别,我必须在每个级别打印f(n)节点.例如:
At level 1 print node number 1 (i.e. root)
At level 2 print node number 2 (from left)
At level 3 print node number 3 (from left)
At level 4 print node number 5... and so on
Run Code Online (Sandbox Code Playgroud)
如果number of nodes(say nl)在任何级别n的less than f(n),则必须打印node number nl%f(n) counting from the left.
我没有使用队列基本层面序遍历,但我停留在如何在每一个级别计算节点和处理情况时,在任何级别的节点个数n为less than f(n).
建议继续解决剩余部分问题的方法.
| 归档时间: |
|
| 查看次数: |
248 次 |
| 最近记录: |